Characterization of a signed graph whose signed line graph is -consistent.
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Biggs, Norman (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Svatopluk Poljak, Daniel Turzík (1978)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Straight, H.Joseph (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
P K. Jha, G Slutzki (1991)
Applicationes Mathematicae
Similarity:
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami (2013)
Kragujevac Journal of Mathematics
Similarity:
Wojciech Wide (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2. For a given graph H we say that G is H-f1-heavy if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K), dK(u, v) = 2 implies that at least one of them is super-heavy. For a family of graphs H we say that G is H-f1-heavy, if G is H-f1-heavy for...
Pavol Híc (1984)
Mathematica Slovaca
Similarity:
Ioan Tomescu (2001)
Matematički Vesnik
Similarity: