Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications (Q498422): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6485824 / rank
 
Normal rank
Property / zbMATH Keywords
 
reciprocal degree distance
Property / zbMATH Keywords: reciprocal degree distance / rank
 
Normal rank
Property / zbMATH Keywords
 
pendants
Property / zbMATH Keywords: pendants / rank
 
Normal rank
Property / zbMATH Keywords
 
diameter
Property / zbMATH Keywords: diameter / rank
 
Normal rank
Property / zbMATH Keywords
 
matching number
Property / zbMATH Keywords: matching number / rank
 
Normal rank
Property / zbMATH Keywords
 
domination number
Property / zbMATH Keywords: domination number / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartition
Property / zbMATH Keywords: bipartition / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-013-9649-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117701440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additively weighted Harary index of some composite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eccentric connectivity index of nanotubes and nanotori / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walks and paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wiener index of trees: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reciprocal degree distance of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with minimal Laplacian coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of graphs by their number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with the seven smallest and eight greatest Harary indices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:31, 10 July 2024

scientific article
Language Label Description Also known as
English
Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
scientific article

    Statements

    Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications (English)
    0 references
    0 references
    0 references
    28 September 2015
    0 references
    reciprocal degree distance
    0 references
    pendants
    0 references
    diameter
    0 references
    matching number
    0 references
    domination number
    0 references
    bipartition
    0 references

    Identifiers