SPECTRAL RADIUS CONDITIONS FOR CONNECTED PLANAR GRAPHS TO HAVE A FEW CUT-EDGES
DOI:
https://doi.org/10.18173/2354-1059.2026-0027Keywords:
planar graph, spectral radius, cut-edgeAbstract
Let G be a graph of order n and let ρ(G) be the spectral radius of the graph G. A cut-edge of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state a condition for a planar graph to have a few cut-edges. After that, we give a sufficient condition on the spectral radius for a planar graph to have a few cut-edges.
References
[1] N. Achuthan, A. R. Rao, “On the number of cut edges in a regular graph”, Australasian Journal of Combinatorics, vol. 27, pp. 5–12, 2003.
[2] A. Ramachandra Rao, “An extremal problem in graph theory”, Israel Journal of Mathematics, vol. 6, pp. 261–266, 1968.
[3] A. Ramachandra Rao, “Some extremal problems and characterizations in the theory of graphs”, Ph.D thesis, Indian Statistical Institute, 1969.
[4] O. Suil and D.B. West, “Balloons, cut edges, matchings, and total domination in regular graphs of odd degree”, Journal of Graph Theory, vol. 64, pp. 116–131, 2010.
[5] J.-M. Guo, Z.-W. Wang and X. Li, “Sharp upper bounds of the spectral radius of a graph”, Discrete Mathematics vol. 342 (2019), 2559–2563.
[6] Y. Hong, “A bound on the spectral radius of graphs”, Linear Algebra and Its Applications, vol. 108, pp. 135–139, 1988.
[7] Y. Hong, J.-L. Shu and K. Fang, “A sharp upper bound of the spectral radius of graphs”, Journal of Combinatorial Theory, Series B, vol. 81, no. 2, pp. 177–183, 2001.
[8] V. Nikiforov, “Some inequalities for the largest eigenvalue of a graph”, Combinatorics, Probability and Computing, vol. 11, no. 2, pp. 179–189, 2002.
[9] S. Sun, K. C. Das. “A conjecture on the spectral radius of graphs”. Linear Algebra and Its Applications, vol. 588, pp. 74-80, 2020.
[10] P. H. Ha, D. D. Hanh, V. Q. Minh, “The number of cut-edges and conflict-free connection number in planar graphs”, arXiv:2606.00533, 2026.
