Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges (Q5051392): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The total irregularity of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mostar index / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\ell\)-distance-balanced graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance-unbalancedness of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum distance-unbalancedness of trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximally distance-unbalanced trees / rank | |||
Normal rank |
Latest revision as of 21:58, 30 July 2024
scientific article; zbMATH DE number 7622409
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges |
scientific article; zbMATH DE number 7622409 |
Statements
Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges (English)
0 references
23 November 2022
0 references
distance-unbalancedness
0 references
total irregularity
0 references
graph of diameter 2
0 references