- Tytuł:
- On composition of signed graphs
- Autorzy:
-
Shahul Hameed, K.
Germina, K. - Tematy:
-
signed graph
eigenvalues
graph composition
regular graphs
net-regular signed graphs - Pokaż więcej
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Powiązania:
- https://bibliotekanauki.pl/articles/743222.pdf Link otwiera się w nowym oknie
- Opis:
- 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.
- Dostawca treści:
- Biblioteka Nauki
Artykuł