Some results on starlike and sunlike graphs (Q1871428): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4327350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new graph product and its spectrum / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Laplacian Spectrum of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: No starlike trees are cospectral / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02935725 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006951722 / rank | |||
Normal rank |
Latest revision as of 11:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some results on starlike and sunlike graphs |
scientific article |
Statements
Some results on starlike and sunlike graphs (English)
0 references
5 September 2003
0 references
If \(G\) is a simple graph on vertices \(1,2,\dots,n\), the sunlike graph \(G(k_1,k_2,\dots,k_n)\) is obtained by identifying an end-vertex of a path \(P_{k_i}\), \(k_i\geq 1\), with vertex \(i\) of \(G\), \(i=1,2,\dots,n\). A formula for the characteristic polynomial of a sunlike graph is given and it is shown that, for \(n\geq 3\), whenever graphs \(K_n(k_1,k_2,\dots,k_n)\) and \(K_n(m_1,m_2,\dots,m_n)\) are cospectral, then they are also isomorphic. As a consequence, it is obtained that no two distinct starlike trees are Laplacian cospectral (a tree is starlike if it has exactly one vertex of degree greater than two).
0 references
spectrum of graph
0 references
Laplacian characteristic polynomial
0 references