.png){kind=icon}
Return
RECOGNIZING SIGNED LINE GRAPHS WITH A
.png){kind=icon}
OA
AI
DOI：10.2298/AADM250525019S.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Line graphs of ordinary graphs have been studied for nearly a century, during which many of their properties have been uncovered. One of them states that the spectrum of the standard {0, 1}-adjacency matrix of every line graph is bounded below by 2. There are graphs that are not line graphs but have the same spectral when they proved that the least eigenvalue of a graph is greater than or equal to 2 graphs, namely graphs that are not generalized line graphs but nevertheless satisfy the required property.
Keywords:
Signed line graph
digon
switching isomorphism
Krausz theorem
Whitney
Journal
A
IF:
0
Papers:
26
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more