International Journal of Mathematics Trends and Technology
Volume 65 | Issue 4 | Year 2019 | Article Id. IJMTT-V65I4P508 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I4P508
A vertex of a k-edge critical graph is called a high vertex, if its degree is k-i and is called a low vertex, if otherwise. In this Paper, we investigate the properties of the low and high vertices and the subgraph induced by the set of low vertices and the set of high vertices of a k-edge critical graph
[1] Suresh Kumar J, ―Studies in Graph Theory-Pseudo-complete coloring and Graphoidal coloring of a graph‖, Ph.D. thesis, M.S. University, Thirunelveli, Tamilnadu, India, 2002.
[2] Suresh Kumar J and Satheesh E.N, ―Pseudo-complete color critical graphs‖, International Journal for Research in Applied Science and Engineering Technology, Volume 6.1, January 2018.
[3] Suresh Kumar J, ―Degrees and degree sequences of PAN critical graphs‖, International Journal of Mathematics and Its Applications, Vol. 6 (1-B) (2018).
[4] Suresh Kumar J, ―Diameter and Traversability of PAN Critical Graphs‖, International Journal of Mathematics Trends and Technology, Vol. 52.7, 2017.
[5] Gupta R.P., Bounds on the chromatic and achromatic numbers of complementary graphs, Recent Progress in Combinatorics (Ed. W. T. Tutte), Academic Press, New York (1969), 22.9- 2.35.
[6] Sampathkumar E. and V.N. Bhave, Partition graphs and coloring numbers of a graph, Discrete Math, 16, (1976), 57-60.
Dr. J. Suresh Kumar, "Locally Critical Elements in Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 4, pp. 39-40, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I4P508
PDF 
Abstract 
Keywords 
References 
Citation