Some applications of a theorem of Schur to graphs and to a class of endomorphisms
Chao, Chong-Yun (1967)
Portugaliae mathematica
Similarity:
Chao, Chong-Yun (1967)
Portugaliae mathematica
Similarity:
Gewurz, Daniele A., Merola, Francesca (2003)
Journal of Integer Sequences [electronic only]
Similarity:
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.
Ivan Gutman (2000)
Kragujevac Journal of Mathematics
Similarity:
Akhtar, Reza, Boggess, Megan, Jackson-Henderson, Tiffany, Jiménez, Isidora, Karpman, Rachel, Kinzel, Amanda, Pritikin, Dan (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jurriaan Hage, Tero Harju (2007)
Discussiones Mathematicae Graph Theory
Similarity:
We investigate which switching classes do not contain a bipartite graph. Our final aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. In addition to the odd cycles, we list a number of exceptional cases and prove that these are indeed critically non-bipartite. Finally, we give a number of structural results towards proving the fact that we have indeed found them all. The search for...
Augustine Munagi (2014)
Open Mathematics
Similarity:
The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions - adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular...
Leroux, Pierre (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley (2004)
Discussiones Mathematicae Graph Theory
Similarity:
For a permutation π of the vertex set of a graph G, the graph π G is obtained from two disjoint copies G₁ and G₂ of G by joining each v in G₁ to π(v) in G₂. Hence if π = 1, then πG = K₂×G, the prism of G. Clearly, γ(G) ≤ γ(πG) ≤ 2 γ(G). We study graphs for which γ(K₂×G) = 2γ(G), those for which γ(πG) = 2γ(G) for at least one permutation π of V(G) and those for which γ(πG) = 2γ(G) for each permutation π of V(G).
Kitaev, Sergey, McAllister, Tyrrell B., Petersen, T. Kyle (2006)
Integers
Similarity: