×

On the maximal distance spectral radius in a class of bicyclic graphs. (English) Zbl 1257.05087

Summary: Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. Let \(P_{p+1} = x_1x_2 \cdots x_{p+1}, P_{t+1} = y_1y_2\cdots y_{t+1}\) and \(P{q+1} = z_1z_2\cdots z_{q+1}\) be three vertex-disjoint paths. Identifying the initial vertices as \(u_0\) and the terminal vertices as \(v_0\), the resultant graph, denoted by \(\theta(p; t; q)\), is called a \(\theta\)-graph. Let \(\mathcal B_n\) be the class of all bicyclic graphs on \(n\) vertices, which contain a \(\theta\)-graph as an induced subgraph.
In this paper, we study the distance spectral radius of bicyclic graphs in \(\mathcal B_n\), and determine the graph with the largest distance spectral radius.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12 Distance in graphs
Full Text: DOI

References:

[1] Cvetković D., Spectra of Graphs – Theory and Application (1995)
[2] DOI: 10.1016/0012-365X(76)90003-0 · Zbl 0328.05103 · doi:10.1016/0012-365X(76)90003-0
[3] DOI: 10.1137/0205006 · Zbl 0326.68027 · doi:10.1137/0205006
[4] DOI: 10.1016/0001-8708(78)90005-1 · Zbl 0382.05023 · doi:10.1016/0001-8708(78)90005-1
[5] DOI: 10.1002/j.1538-7305.1971.tb02618.x · Zbl 0228.94020 · doi:10.1002/j.1538-7305.1971.tb02618.x
[6] DOI: 10.1002/jgt.3190140309 · Zbl 0734.05037 · doi:10.1002/jgt.3190140309
[7] DOI: 10.1016/j.laa.2011.07.031 · Zbl 1236.05164 · doi:10.1016/j.laa.2011.07.031
[8] DOI: 10.1080/03081089008818032 · Zbl 0728.05043 · doi:10.1080/03081089008818032
[9] DOI: 10.13001/1081-3810.1366 · Zbl 1189.05050 · doi:10.13001/1081-3810.1366
[10] DOI: 10.1016/j.aml.2008.11.007 · Zbl 1179.05040 · doi:10.1016/j.aml.2008.11.007
[11] DOI: 10.1016/j.disc.2011.05.040 · Zbl 1226.05112 · doi:10.1016/j.disc.2011.05.040
[12] DOI: 10.1080/03081087.2010.499512 · Zbl 1222.05184 · doi:10.1080/03081087.2010.499512
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.