✦ LIBER ✦

The spectral radius of graphs without paths and cycles of specified length

✍ Scribed by Vladimir Nikiforov

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 183 KB
Volume: 432
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.05.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectral determination of graphs whose c

Spectral determination of graphs whose components are paths and cycles

✍ Dragoš Cvetković; Slobodan K. Simić; Zoran Stanić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 353 KB

We consider the class of graphs each of whose components is either a path or a cycle. We classify the graphs from the class considered into those which are determined and those which are not determined by the adjacency spectrum. In addition, we compare the result with the corresponding results for t

Relative length of longest paths and cyc

Relative length of longest paths and cycles in 3-connected graphs

✍ Rao Li; Akira Saito; R.H. Schelp 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 2 views

## Abstract For a graph __G__, let __p(G)__ denote the order of a longest path in __G__ and __c(G)__ the order of a longest cycle in __G__, respectively. We show that if __G__ is a 3‐connected graph of order __n__ such that $\textstyle{\sum^{4}\_{i=1}\,{\rm deg}\_{G}\,x\_{i} \ge {3\over2}\,n + 1}$

Relative lengths of paths and cycles in

Relative lengths of paths and cycles in k-connected graphs

✍ S.C Locke 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 583 KB

Walks and the spectral radius of graphs

✍ Vladimir Nikiforov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Relative length of long paths and cycles

Relative length of long paths and cycles in graphs with large degree sums

✍ Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

## Abstract For a graph __G, p__(__G__) denotes the order of a longest path in __G__ and __c__(__G__) the order of a longest cycle. We show that if __G__ is a connected graph __n__ ≥ 3 vertices such that __d__(__u__) + __d__(__v__) + __d__(__w__) ≧ n for all triples __u, v, w__ of independent verti

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