✦ LIBER ✦

The uniqueness of a certain graph

✍ Scribed by Allan Gewirtz; Louis V Quintas

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 394 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90012-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic uniqueness of the generalized

Chromatic uniqueness of the generalized θ-graph

✍ Beatrice Loerinc 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 323 KB

A generalized O-graph i.~ a wnnected graph with 3 palths between a pair of vertices of degree 3. It is showi:~ that uny graph having the same ckomatic polynomial as a generaiized O-graph, must be isomorphic to tk generalized O-graph.

The chromatic uniqueness of certain brok

The chromatic uniqueness of certain broken wheels

✍ K.M. Koh; C.P. Teo 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 178 KB

On uniqueness of a general factorization

On uniqueness of a general factorization of graph properties

✍ Ewa Drgas-Burchardt 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract A graph property is any class of simple graphs, which is closed under isomorphisms. Let __H__ be a given graph on vertices __v__~1~, …, __v__~__n__~. For graph properties 𝒫~1~, …, 𝒫~__n__~, we denote by __H__[𝒫~1~, …, 𝒫~__n__~] the class of those (𝒫~1~, …, 𝒫~__n__~) ‐partitionable grap

The uniqueness of the strongly regular g

The uniqueness of the strongly regular graph on 77 points

✍ A. E. Brouwer 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 1 views

Uniqueness of certain polynomials consta

Uniqueness of certain polynomials constant on a line

✍ Jiří Lebl; Daniel Lichtblau 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB

The number of shortest cycles and the ch

The number of shortest cycles and the chromatic uniqueness of a graph

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 2 views

## Abstract For a graph __G__, let __g__(__G__) and σ~g~(__G__) denote, respectively, the girth of __G__ and the number of cycles of length __g__(__G__) in __G__. In this paper, we first obtain an upper bound for σ~g~(__G__) and determine the structure of a 2‐connected graph __G__ when σ~g~(__G__)