The minimum degree distance of graphs of given order and size (Q1003746): 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.dam.2008.03.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096789153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree powers in graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of powers of the degrees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moments of graphs in monotone families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of the squares of degrees: sharp asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal properties of the degree distance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unicyclic and bicyclic graphs having minimum degree distance / rank
 
Normal rank

Latest revision as of 02:37, 29 June 2024

scientific article
Language Label Description Also known as
English
The minimum degree distance of graphs of given order and size
scientific article

    Statements

    Identifiers