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:
Displaying similar documents to “On the toughness of cycle permutation graphs”
Characterization of a signed graph whose signed line graph is -consistent.
Domination in functigraphs
Linda Eroh, Ralucca Gera, Cong X. Kang, Craig E. Larson, Eunjeong Yi (2012)
Discussiones Mathematicae Graph Theory
Similarity:
Let G₁ and G₂ be disjoint copies of a graph G, and let f:V(G₁) → V(G₂) be a function. Then a functigraph C(G,f) = (V,E) has the vertex set V = V(G₁) ∪ V(G₂) and the edge set E = E(G₁) ∪ E(G₂) ∪ {uv | u ∈ V(G₁), v ∈ V(G₂),v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let γ(G) denote the domination number of G. It is readily seen that γ(G)...
Voltage graphs, group presentations and cages.
Exoo, Geoffrey (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on maximal -degenerate graphs
Z. Filáková, Peter Mihók, Gabriel Semanišin (1997)
Mathematica Slovaca
Similarity:
A note on signed cycle domination in graphs
Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami (2013)
Kragujevac Journal of Mathematics
Similarity:
On the classification and toughness of generalized permutation star-graphs
Chong-Yun Chao, Shaocen Han (1997)
Czechoslovak Mathematical Journal
Similarity:
We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star-graphs.