×

Balancedness and spectra of signed graphs obtained by \(\dot{H}\)-join operation. (English) Zbl 1476.05068

Summary: In this paper, we consider a generalized join operation, the \(\dot{H}\)-join on signed graphs, where \(\dot{H}\) is an arbitrary signed graph. We characterize the balancedness of the \(\dot{H}\)-join graph, determine the adjacency spectra of graphs obtained by this operation on net regular graphs and the Laplacian spectra of graphs obtained on negatively regular graphs. Some additional consequences relevant to integral or cospectral graphs are also given.

MSC:

05C22 Signed and weighted graphs
05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C76 Graph operations (line graphs, products, etc.)
Full Text: DOI

References:

[1] Belardo, F., Balancedness and the least eigenvalue of Laplacian of signed graphs, Linear Algebra Appl, 446, 133-147 (2014) · Zbl 1285.05112 · doi:10.1016/j.laa.2014.01.001
[2] Belardo, F.; Brunetti, M.; Ciampella, A., Signed bicyclic graphs minimizing the least Laplacian eigenvalue, Linear Algebra Appl, 557, 201-233 (2018) · Zbl 1396.05066 · doi:10.1016/j.laa.2018.07.026
[3] Belardo F, Cioabă SM, Koolen J, Wang J, (2018) Open problems in the spectral theory of signed graphs. Art Discrete Appl Math., 1: \( \sharp\) P2.10(23 pages) · Zbl 1421.05052
[4] Brunetti, M.; Cavaleri, M.; Donno, A., A lexicographic product for signed graphs, Aust J Combinatorics, 74, 2, 332-343 (2019) · Zbl 1419.05182
[5] Cardoso, DM; Freitas, MA; Martins, EA; Robbiano, M., Spectra of graphs obtained by a generalization of the join graph operation, Discrete Math, 313, 733-741 (2013) · Zbl 1259.05113 · doi:10.1016/j.disc.2012.10.016
[6] Chen, Y.; Chen, H., The characteristic polynomial of a generalized join graph, Appl Math Comput, 348, 456-464 (2019) · Zbl 1404.65164 · doi:10.1016/j.cam.2018.08.044
[7] Gerbaud, A., Spectra of generalized compositions of graphs and hierarchical networks, Discrete Math, 310, 2824-2830 (2010) · Zbl 1208.05073 · doi:10.1016/j.disc.2010.06.019
[8] Gutman, I.; Medina, L.; Pizarro, P.; Robbiano, M., Graphs with maximum Laplacian and signless Laplacian Estrada index, Discrete Math, 339, 2664-2671 (2016) · Zbl 1339.05234 · doi:10.1016/j.disc.2016.04.022
[9] Hameed, S.; Germina, KA, On composition of signed graphs, Discuss Math. Graph Theory, 32, 507-516 (2012) · Zbl 1257.05056 · doi:10.7151/dmgt.1615
[10] Harary, F., On the notion of balanced in a signed graph, Michigan Math J, 2, 143-146 (1953) · Zbl 0056.42103 · doi:10.1307/mmj/1028989917
[11] He, C.; Liu, S.; Wu, B., Three distance characteristic polynomials of some graphs, Linear Algebra Appl, 452, 281-291 (2014) · Zbl 1290.05102 · doi:10.1016/j.laa.2014.03.045
[12] Heider, F., Attitude and cognitive organization, Psychologia, 21, 107-112 (1946)
[13] Schwenk AJ, (1974) Computing the characteristic polynomial of a graph, in: Bary R., Harary F.(Eds.), Graphs Combinatorics, in: Lecture Notes in Math., 406: 153-172, Springer-Verlag, Berlin · Zbl 0308.05121
[14] Wu B, Lou Y, He C, (2014) Signless Laplacian and normalized Laplacian on the H-join operation of graphs, Discret. Math. Algorithms Appl., 6(3): 1450046(13 pages) · Zbl 1298.05215
[15] Zaslavsky T, (2010) Matrices in the theory of signed simple graphs, in: Acharya B.D., Katona G.O.H., Nešetřil J.(Eds.), Advances in Discrete Mathematics and Applications, Mysore(2008), in: Ramanujan Math. Soc. Lect. Notes Ser., 13: 207-229, Ramanujan Math. Soc · Zbl 1231.05120
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.