A note on diameter and the degree sequence of a graph (Q659834): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aml.2011.08.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057397453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distance and the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius, diameter, and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and inverse degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameter and inverse degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly irregular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance, minimum degree, and spanning trees / rank
 
Normal rank

Latest revision as of 21:25, 4 July 2024

scientific article
Language Label Description Also known as
English
A note on diameter and the degree sequence of a graph
scientific article

    Statements

    A note on diameter and the degree sequence of a graph (English)
    0 references
    0 references
    24 January 2012
    0 references
    diameter
    0 references
    minimum degree
    0 references
    degree sequence
    0 references

    Identifiers