✦ LIBER ✦

The cohesiveness of a point of a graph

✍ Scribed by Jin Akiyama; Frank Boesch; Hiroshi Era; Frank Harary; Ralph Tindell

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 184 KB
Volume: 11
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230110107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge nucleus of a point-determining

The edge nucleus of a point-determining graph

✍ Dennis P Geoffroy; David P Sumner 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 712 KB

The least point covering and domination

The least point covering and domination numbers of a graph

✍ E. Sampathkumar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 310 KB

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

A Geometric Construction of Partial Geom

A Geometric Construction of Partial Geometries with a Hermitian Point Graph

✍ Elisabeth Kuijken 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

In 1998 Mathon constructed algebraically a class of partial geometries pg(q -1, (q 2 -1)/2, (q -1)/2), where q is an even power of 3. The point graph of these partial geometries is the Hermitian graph constructed by Taylor. In this paper a geometric construction of Mathon's partial geometries is giv

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

The biparticity of a graph

✍ Frank Harary; Derbiau Hsu; Zevi Miller 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract The biparticity β(__G__) of a graph __G__ is the minimum number of bipartite graphs required to cover __G__. It is proved that for any graph __G__, β(__G__) = {log~2~χ(__G__)}. In view of the recent announcement of the Four Color Theorem, it follows that the biparticity of every planar