On the mean subtree order of graphs under edge addition (Q6055400): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3088594123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average size of independent sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results on average subtree density of series-reduced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of nodes in a subtree of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of the mean order of subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the mean subtree order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average order of a subtree of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishable trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local and Global Means of Subtree Orders / rank
 
Normal rank

Latest revision as of 00:52, 3 August 2024

scientific article; zbMATH DE number 7743901
Language Label Description Also known as
English
On the mean subtree order of graphs under edge addition
scientific article; zbMATH DE number 7743901

    Statements

    Identifiers