On the Spectral Characterization of H-Shape Trees - Advances in Linear Algebra & Matrix Theory

ALAMT > Vol.4 No.2, June 2014

Advances in Linear Algebra & Matrix Theory

Volume 4, Issue 2 (June 2014)

ISSN Print: 2165-333X ISSN Online: 2165-3348

Google-based Impact Factor: 0.11 Citations

On the Spectral Characterization of H-Shape Trees ()

HTML

Download as PDF (Size: 360KB) PP. 79-86

DOI: 10.4236/alamt.2014.42005 2,534 Downloads 3,990 Views Citations

Author(s)

Shengbiao Hu

Affiliation(s)

Department of Mathematics, Qinghai Nationalities University, Xining, China.

ABSTRACT

A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. An H-shape is a tree with exactly two of its vertices having maximal degree 3. In this paper, a formula of counting the number of closed 6-walks is given on a graph, and some necessary conditions of a graph Γ cospectral to an H-shape are given.

KEYWORDS

Spectra of Graphs, Cospectral Graphs, Spectra Radius, H-Shape Trees, Determined by Its Spectrum

Share and Cite:

Hu, S. (2014) On the Spectral Characterization of H-Shape Trees. Advances in Linear Algebra & Matrix Theory, 4, 79-86. doi: 10.4236/alamt.2014.42005.

Cited by

[1]	星型树和双星树的谱半径的界
	2019

[2]	On the Characteristic Polynomial of t-Tuple and b-Bridge Coalescence Graphs
	2018

[3]	A Solution Algorithm for the Same Spectrum of Two Π-Shaped Trees
	2018

[4]	On the Characteristic Polynomial of t-Tuple and b-Bridge Coalescence Graphs.
	Southeast Asian Bulletin of Mathematics, 2018

[5]	两棵 Π-型树同谱的求解算法
	2018

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies