✦ LIBER ✦

The cordiality of the path-union of n copies of a graph

✍ Scribed by Sze-Chin Shee; Yong-Song Ho

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 338 KB
Volume: 151
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00099-5

No coin nor oath required. For personal study only.

✦ Synopsis

Let G 1, G 2 .... , G. be n (~>2) copies of a graph G. We denote by G(n) the graph obtained by adding an edge to G i and G i÷ 1, i = 1,2 ..... n -1, and we call G(n) the path-union of n copies of the graph G.

We shall relate the cordiality of the path-union of n copies of a graph to the solution of a system involving an equation and two inequalities, and give some sufficient conditions for that path-union to be cordial. The path-unions of such graphs as cycles, wheels, fans, some cliques, Cartesian products and compositions of some graphs are shown to be cordial.

📜 SIMILAR VOLUMES

The cordiality of one-point union of n c

The cordiality of one-point union of n copies of a graph

✍ Sze-Chin Shee; Yong-Song Ho 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 877 KB

Shee, S.-C. and Y.-S. Ho, The cordiality of one-point union of n copies of a graph, Discrete Mathematics 117 (1993) 225-243. In this paper we give an equivalent definition of a cordial graph. The definition implies a previous result of Cahit (1986); it also enables us to find infinite families of n

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

Matching and covering the vertices of a

Matching and covering the vertices of a random graph by copies of a given graph

✍ Andrzej Ruciński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 747 KB

## Rucidski, A., Matching and covering the vertices of a random graph by copies of a given graph, Discrete Mathematics 105 (1992) 185-197. In this paper we partially answer the question: how slowly must p(n) converge to 0 so that a random graph K(n, p) has property PM, almost surely, where PM, me

Reconstructing the number of copies of a

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph

✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _

On the characterization of path graphs

✍ Huaien Li; Yixun Lin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract Broersma and Hoede have introduced path graphs. Their characterization of __P__~3~‐graphs contains a flaw. This note presents the correct form of the characterization. © 1993 John Wiley & Sons, Inc.

A graph-theoretic version of the union-c

A graph-theoretic version of the union-closed sets conjecture

✍ El-Zahar, Mohamed H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture