On the maximal distance spectral radius of graphs without a pendent vertex (Q389706): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2013.01.019 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2013.01.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044111071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectral radius of graphs with \(r\) pendent vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectral radius of cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectral radius of trees / 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: Some graft transformations and its applications on the distance spectral radius of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graft transformations and its application on a distance spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and minimal distance spectral radius of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2013.01.019 / rank
 
Normal rank

Latest revision as of 16:07, 9 December 2024

scientific article
Language Label Description Also known as
English
On the maximal distance spectral radius of graphs without a pendent vertex
scientific article

    Statements

    On the maximal distance spectral radius of graphs without a pendent vertex (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2014
    0 references
    distance matrix
    0 references
    cactus
    0 references
    \(\infty(p
    0 references
    l
    0 references
    q)\)-graph
    0 references
    \(\theta(p
    0 references
    t
    0 references
    Saw-graph
    0 references

    Identifiers