Connectivity of The Mycielskian of A Graph
Keywords:
Abstract
We use in place of , and in place of when no ambiguity arises. Moreover, for , denotes the subgraph of induced by the vertices of . Similarly, for a vertex of , means . The connectivity of a connected graph is the least positive integer such that there exists , and is disconnected or reduces to the trivial graph . An obvious inference from the definition of is that for all . Consequently, (here stands for the degree and for the minimum degree). Also . Chang et.al., have proved Lemma 3.1.1.
References
- R. Balakrishnan, S. Francis Raj, Connectivity of the Mycielskian of a graph, Discrete Math., (2007).
- C. D. Godsil, G. Royle, Algebraic Graph Theory, New York, (2001).
- J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, (2008).
- G. J. Chang, L. Huang, X. Zhu, Circular chromatic number of Mycielski’s graph, Discrete Math., 205 (1999), 23 – 37.
- G. Chartrand and L. Lesniak, Graphs and Diagraphs, Chapman and Hall/CRC, America, (2000).
- M.E. Watkins, Connectivity of transitive graphs, J. Combin Theory, 8 (1970), 23 – 29.
- F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, (1969).
- G. Chartrand and L. Lesniak, Graphs and Digraphs, Chapman and Hall/CRC, America, (2000).
- M.E. Watkins, Connectivity of transitive graphs, J. Combin Theory, 8
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.