✦ LIBER ✦

Two sets of graceful graphs

✍ Scribed by Charles Delorme

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 109 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040214

No coin nor oath required. For personal study only.

✦ Synopsis

We give graceful numberings to the following graphs: (a) the union of n K4 having one edge in common, in other words the join of K2 and the union of n disjoint K2 and (b) the union of n C4 having one edge in common, in other words the product of K2 and K,,", with n + l not a multiple of 4.

📜 SIMILAR VOLUMES

Graceful valuations of 2-regular graphs

Graceful valuations of 2-regular graphs with two components

✍ Jaromir Abrham; Anton Kotzig 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 714 KB

All 2-regular graphs consisting of 4-cyc

All 2-regular graphs consisting of 4-cycles are graceful

✍ Jaromir Abrham; Anton Kotzig 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 871 KB

It is shown that the graph kc, (consisting of k 4-cycles) has an a-valuation (a stronger form of the graceful valuation) for every positive integer k # 3. The graph 3C, is known to be graceful but it does not have an a-valuation.

Partitions of graphs into one or two ind

Partitions of graphs into one or two independent sets and cliques

✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized

Set colourings of graphs

✍ Béla Bollobás; Andrew Thomason 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Clique-transversal sets of line graphs a

Clique-transversal sets of line graphs and complements of line graphs

✍ Thomas Andreae; Martin Schughart; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(

Graphs with unique minimum edge dominati

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s