๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Spectral conditions for the reconstructibility of a graph

โœ Scribed by C.D Godsil; B.D McKay

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
251 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The spectral radii of a graph and its li
The spectral radii of a graph and its line graph
โœ Lingsheng Shi ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 150 KB

The spectral radius of a (directed) graph is the largest eigenvalue of adjacency matrix of the (directed) graph. We give the relation on the characteristic polynomials of a directed graph and its line graph, and obtain sharp bounds on the spectral radius of directed graphs. We also give the relation

A degree condition for the circumference
A degree condition for the circumference of a graph
โœ Nathaniel Dean; Pierre Fraisse ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 198 KB ๐Ÿ‘ 1 views

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let rn be any positive integer. Suppose G is a 2-connected graph with vertices x,, . . . , x, and edge set E that satisfies the proper