Results 291 to 296 of about 329,714 (296)
Some of the next articles are maybe not open access.
2021
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Jay S. Bagga, Lowell W. Beineke
openaire +2 more sources
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Jay S. Bagga, Lowell W. Beineke
openaire +2 more sources
Geometriae Dedicata, 1977
Let A be a symmetric matrix with entries (0, 1, -1) and λ1(A) its smallest eigenvalue. We consider the question of how closely A−λ1(A)I can be approximated by a gramian KKT, where each entry in K is 0, 1, or -1.
openaire +3 more sources
Let A be a symmetric matrix with entries (0, 1, -1) and λ1(A) its smallest eigenvalue. We consider the question of how closely A−λ1(A)I can be approximated by a gramian KKT, where each entry in K is 0, 1, or -1.
openaire +3 more sources
Characterizations of signed graphs
Journal of Graph Theory, 1981AbstractThe possible classes of balanced circles of a signed graph are characterized in two ways.
openaire +2 more sources
On the Signed Domination in Graphs
Combinatorica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the number of balanced signed graphs
The Bulletin of Mathematical Biophysics, 1967The classical enumeration theorem of Polya (Acta Math.,68, 145–254, 1937) is applied to a modified version of Harary’s (Pacific J. Math.,8, 743–755, 1958) generating functions for counting bicolored graphs to derive a counting function for the number of balanced signed graphs. Methods for computing these counting polynomial functions are discussed.
Frank Harary, Edgar M. Palmer
openaire +4 more sources