- Tytuł:
- On •-Line Signed Graphs L•(S)
- Autorzy:
-
Sinha, Deepa
Dhama, Ayushi - Powiązania:
- https://bibliotekanauki.pl/articles/31339494.pdf
- Data publikacji:
- 2015-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
sigraph
line graph
•-line sigraph
balance
sign-compatibility
C-sign-compatibility - Opis:
- A signed graph (or sigraph for short) is an ordered pair S = (Su,σ), where Su is a graph, G = (V,E), called the underlying graph of S and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}. For a sigraph S its •-line sigraph, L•(S) is the sigraph in which the edges of S are represented as vertices, two of these vertices are defined adjacent whenever the corresponding edges in S have a vertex in common, any such L-edge ee′ has the sign given by the product of the signs of the edges incident with the vertex in e ∩ e′. In this paper we establish a structural characterization of •-line sigraphs, extending a well known characterization of line graphs due to Harary. Further we study several standard properties of •-line sigraphs, such as the balanced •-line sigraphs, sign-compatible •-line sigraphs and C-sign-compatible •-line sigraphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 215-227
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł