✦ LIBER ✦

On the radius and diameter of the clique graph

✍ Scribed by Ronald D. Dutton; Robert C. Brigham

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 124 KB
Volume: 147
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00277-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Spectral Radius and the Genus of

On the Spectral Radius and the Genus of Graphs

✍ H. Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 205 KB

In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

On the spectral radius of a directed gra

On the spectral radius of a directed graph

✍ Kwapisz, Jaroslaw 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 2 views

We provide upper estimates on the spectral radius of a directed graph. In particular w e prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.

The Spectral Radius of Graphs on Surface

The Spectral Radius of Graphs on Surfaces

✍ M.N. Ellingham; Xiaoya Zha 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 152 KB

This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th

On the Spectrum, the Growth, and the Dia

On the Spectrum, the Growth, and the Diameter of a Graph

✍ N. Hajaj 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A lower bound is given for the harmonic mean of the growth in a finite undirected graph 1 in terms of the eigenvalues of the Laplacian of 1. For a connected graph, this bound is tight if and only if the graph is distance-regular. Bounds on the diameter of a ``sphere-regular'' graph follow. Finally,

The greedy clique decomposition of a gra

The greedy clique decomposition of a graph

✍ Sean McGuinness 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract We prove that if maximal cliques are removed one by one from any graph with __n__ vertices, then the graph will be empty after at most __n__^2^/4 steps. This proves a conjecture of Winkler.