On composition of signed graphs
Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 3, pp. 507-516
Voir la notice de l'article provenant de la source Library of Science
A graph whose edges are labeled either as positive or negative is called a signed graph. In this article, we extend the notion of composition of (unsigned) graphs (also called lexicographic product) to signed graphs. We employ Kronecker product of matrices to express the adjacency matrix of this product of two signed graphs and hence find its eigenvalues when the second graph under composition is net-regular. A signed graph is said to be net-regular if every vertex has constant net-degree, namely, the difference of the number of positive and negative edges incident with a vertex. We also characterize balance in signed graph composition and have some results on the Laplacian matrices of this product.
Keywords:
signed graph, eigenvalues, graph composition, regular graphs, net-regular signed graphs
@article{DMGT_2012_32_3_a9,
author = {Shahul Hameed, K. and Germina, K.},
title = {On composition of signed graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {507--516},
publisher = {mathdoc},
volume = {32},
number = {3},
year = {2012},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_3_a9/}
}
Shahul Hameed, K.; Germina, K. On composition of signed graphs. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 3, pp. 507-516. http://geodesic.mathdoc.fr/item/DMGT_2012_32_3_a9/