Pages that link to "Item:Q4616101"

The following pages link to On the Mean Connected Induced Subgraph Order of Cographs (Q4616101):

Displaying 9 items.

• The average size of a connected vertex set of a \(k\)-connected graph (Q2043391) (← links)
• The path minimises the average size of a connected induced subgraph (Q2113349) (← links)
• A lower bound on the average size of a connected vertex set of a graph (Q2664553) (← links)
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
• On the Mean Order of Connected Induced Subgraphs of Block Graphs (Q5109058) (← links)
• On the mean subtree order of graphs under edge addition (Q6055400) (← links)
• The average size of a connected vertex set of a graph—Explicit formulas and open problems (Q6055930) (← links)
• The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
• A tight upper bound on the average order of dominating sets of a graph (Q6642500) (← links)