Graphic matrices
Zofia Majcher (1988)
Mathematica Slovaca
Similarity:
Zofia Majcher (1988)
Mathematica Slovaca
Similarity:
Zofia Majcher (1985)
Archivum Mathematicum
Similarity:
Michel Mollard (1990)
Czechoslovak Mathematical Journal
Similarity:
Peter Bugata, Mirko Horňák, Stanislav Jendroľ (1989)
Časopis pro pěstování matematiky
Similarity:
Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
K. Shahul Hameed, K.A. Germina (2012)
Discussiones Mathematicae Graph Theory
Similarity:
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,...