Ordering connected graphs having small degree distances (Q602693): Difference between revisions
From MaRDI portal
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.2010.05.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068376552 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The minimum degree distance of graphs of given order and size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3374676 / 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 | |||
| Property / cites work | |||
| Property / cites work: Properties of connected graphs having minimum degree distance / rank | |||
Normal rank | |||
Latest revision as of 09:55, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ordering connected graphs having small degree distances |
scientific article |
Statements
Ordering connected graphs having small degree distances (English)
0 references
5 November 2010
0 references
degree distance
0 references
eccentricity
0 references
diameter
0 references
tree
0 references
bistar
0 references
