✦ LIBER ✦

Group path covering and -labelings of diameter two graphs

✍ Scribed by Feng Wang; Wensong Lin

Book ID: 113663289
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 182 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.11.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path covering number and -labeling numbe

Path covering number and -labeling number of graphs

✍ Lu, Changhong; Zhou, Qing 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Labelings of plane graphs containing Ham

Labelings of plane graphs containing Hamilton path

✍ Martin Bača; Ljiljana Brankovic; Andrea Semaničová-Feňovčíková 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 353 KB

Group labelings of graphs

✍ Paul H. Edelman; Michael Saks 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Given a graph Γ an abelian group __G__, and a labeling of the vertices of Γ with elements of __G__, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such

Pebbling in diameter two graphs and prod

Pebbling in diameter two graphs and products of paths

✍ Clarke, T. A.; Hochberg, R. A.; Hurlbert, G. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

Results regarding the pebbling number of various graphs are presented. We say a graph is of Class 0 if its pebbling number equals the number of its vertices. For diameter d we conjecture that every graph of sufficient connectivity is of Class 0. We verify the conjecture for d = 2 by characterizing t

Labelings of two classes of plane graphs

✍ Bača Martin 📂 Article 📅 1993 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 197 KB

Reduced graphs of diameter two

✍ Hong-Jian Lai 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract A graph __H__ is __collapsible__ if for every subset X ⊆ __V(H), H__ has a spanning connected subgraph whose set of odd‐degree vertices is X. In any graph __G__ there is a unique collection of maximal collapsible subgraphs, and when all of them are contracted, the resulting contraction