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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6248211 / rank
 
Normal rank
Property / zbMATH Keywords
 
distance matrix
Property / zbMATH Keywords: distance matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
cactus
Property / zbMATH Keywords: cactus / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\infty(p
Property / zbMATH Keywords: \(\infty(p / rank
 
Normal rank
Property / zbMATH Keywords
 
l
Property / zbMATH Keywords: l / rank
 
Normal rank
Property / zbMATH Keywords
 
q)\)-graph
Property / zbMATH Keywords: q)\)-graph / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\theta(p
Property / zbMATH Keywords: \(\theta(p / rank
 
Normal rank
Property / zbMATH Keywords
 
t
Property / zbMATH Keywords: t / rank
 
Normal rank
Property / zbMATH Keywords
 
Saw-graph
Property / zbMATH Keywords: Saw-graph / rank
 
Normal rank

Revision as of 13:46, 29 June 2023

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