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

Note on the spectral characterization of some cubic graphs with maximum number of triangles

โœ Scribed by Fenjin Liu; Qiongxiang Huang; Hong-Jian Lai

Book ID
119317715
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
292 KB
Volume
438
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the maximum induced forests of a conn
On the maximum induced forests of a connected cubic graph without triangles
โœ Maolin Zheng; Xiaoyun Lu ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB

Let t(G) denote the cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that r(G) 3 2n/3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. [l]. Using this

On the characterization of graphs with m
On the characterization of graphs with maximum number of spanning trees
โœ L. Petingi; F. Boesch; C. Suffel ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 591 KB

A graph G with n nodes and e edges is said to be t-optimal if G has the maximum number of spanning trees among all graphs with the same number of nodes and edges as G. Hitherto, t-optimal graphs have been characterized for the following cases: (a) n=sp, and e=(s(s-1)/2)p 2, when s and p are positive