✦ LIBER ✦

The trivalent symmetric graphs of girth at most six

✍ Scribed by Robert C. Miller

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 864 KB
Volume: 10
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90075-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Domination Number of Cubic Graphs wi

The Domination Number of Cubic Graphs with Girth at least Five

✍ David C. Fisher; Kathryn Fraughnaugh; Suzanne M. Seager 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 356 KB

The pagenumber of toroidal graphs is at

The pagenumber of toroidal graphs is at most seven

✍ Toshiki Endo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 442 KB

In this paper, we show that seven pages are sufficient for a book embedding of any toroidal graph.

A new upper bound for the spectral radiu

A new upper bound for the spectral radius of graphs with girth at least 5

✍ Mei Lu; Huiqing Liu; Feng Tian 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The chromaticity of complete bipartite g

The chromaticity of complete bipartite graphs with at most one edge deleted

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB 👁 1 views

## Abstract Let __K(p, q), p ≤ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ ≥ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del

On the maximum and minimum Zagreb indice

On the maximum and minimum Zagreb indices of graphs with connectivity at most

✍ Shuchao Li; Haibing Zhou 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 401 KB

a b s t r a c t For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of the products of degrees of pairs of adjacent vertices. In this paper, we study the Zagreb indices of graphs of order n with

The rainbow connection of a graph is (at

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

✍ Michael Krivelevich; Raphael Yuster 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

## Abstract An edge‐colored graph __G__is __rainbow edge‐connected__ if any two vertices are connected by a path whose edges have distinct colors. The __rainbow connection__ of a connected graph __G__, denoted by __rc__(__G__), is the smallest number of colors that are needed in order to make __G__