Some graft transformations and its application on a distance spectrum (Q641178): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance spectral radius of trees with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds on the distance spectral radius and the distance energy of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spectral radius of the distance matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectral radius of trees with fixed maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distance Spectral Radius and Distance Energy of Graphs / rank
 
Normal rank

Revision as of 14:10, 4 July 2024

scientific article
Language Label Description Also known as
English
Some graft transformations and its application on a distance spectrum
scientific article

    Statements

    Some graft transformations and its application on a distance spectrum (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 October 2011
    0 references
    This paper characterizes those graphs which have minimal distance spectral radius and maximal distance spectral radius among unicyclic graphs. The paper is divided into four sections. The first section, being the introduction, includes definitions and theorems needed in the sequel. Section 2 is dealing with graft transformation, Section 3 discusses the unicyclic graphs with minimum distance spectral radius, and Section 4 deals with the unicyclic graphs with maximum distance spectral radius.
    0 references
    graft transformation
    0 references
    distance
    0 references
    spectral radium
    0 references
    unicyclic graphs
    0 references
    eigenvalue
    0 references

    Identifiers