Results 11 to 20 of about 735,632 (298)
AbstractA signed graph is a graph with a sign attached to each arc. This article introduces the matroids of signed graphs, which generalize both the polygon matroids and the even-circle (or unoriented cycle) matroids of ordinary graphs. The concepts of balance, switching, restriction and contraction, double covering graphs, and linear representation of
Ebrahim Ghorbani +3 more
core +8 more sources
The H-Line Signed Graph Of A Signed Graph [PDF]
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.
Rangarajan, R. +2 more
openaire +4 more sources
Characterization of Line-Consistent Signed Graphs [PDF]
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj +4 more sources
Representations of signed graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yuqing +4 more
openaire +4 more sources
On Regular Signed Graphs with Three Eigenvalues [PDF]
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular.
Anđelić Milica +2 more
doaj +3 more sources
On Laplacian Equienergetic Signed Graphs
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj +2 more sources
Signed distance in signed graphs [PDF]
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the distance spectrum of some unbalanced signed graphs.
Shahul K. Hameed +4 more
openaire +2 more sources
Connected signed graphs L-cospectral to signed ∞-graphs
A signed graph is a pair Γ=(G,σ), where G=(V(G),E(G)) is a graph and σ:E(G)→{+1,−1} is the sign function on the edges of G.
Belardo, Francesco, Brunetti, Maurizio
openaire +3 more sources
The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total signed graph and we show that it is stable under switching.
Francesco Belardo +2 more
openaire +5 more sources
Laplacian integral subcubic signed graphs [PDF]
A (signed) graph is called Laplacian integral if all eigenvalues of its Laplacian matrix are integers. In this paper, we determine all connected Laplacian integral signed graphs of maximum degree 3; among these signed graphs,there are two classes of ...
Wang, Dijian, Hou, Yaoping
core +1 more source

