Edge-disjoint 1-factors in powers of connected graphs
Ladislav Nebeský (1984)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “The Connell sum sequence.”
Edge-disjoint 1-factors in powers of connected graphs
On graphs with prescribed subgraphs of order , and a theorem of Kelly and Merriell
Yair Caro (1994)
Czechoslovak Mathematical Journal
Similarity:
Growth of graph powers.
Pokrovskiy, A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multigraphs (only) satisfy a weak triangle removal lemma.
Shapira, Asaf, Yuster, Raphael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A reciprocity theorem for domino tilings.
Propp, James (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A two-dimensional van Aardenne-Ehrenfest theorem in irregularities of distribution
József Beck (1989)
Compositio Mathematica
Similarity:
On super (a,d)-edge antimagic total labeling of certain families of graphs
P. Roushini Leely Pushpam, A. Saibulla (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,...,p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2,..., p} and the edge labels are {p + 1, p + 2,...,p + q}. In this paper, we study the super (a,d)-edge antimagic total labeling of special classes of graphs...