On the Mean Order of Connected Induced Subgraphs of Block Graphs

zbMath1439.05123arXiv1811.05430MaRDI QIDQ5109058

Ortrud R. Oellermann, Matthew E. Kroeker, Kristaps J. Balodis, L. A. S. Mól

Publication date: 7 May 2020

Full work available at URL: https://arxiv.org/abs/1811.05430

zbMATH Keywords

CIS ordermean connected induced subgraph order

Mathematics Subject Classification ID

Connectivity (05C40) Graph designs and isomorphic decomposition (05C51)

Related Items (4)

A lower bound on the average size of a connected vertex set of a graph ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ The average size of a connected vertex set of a \(k\)-connected graph ⋮ The path minimises the average size of a connected induced subgraph

Cites Work

• Indistinguishable trees and graphs
• The average order of a subtree of a tree
• On the average number of nodes in a subtree of a tree
• The average size of independent sets of graphs
• The mean order of sub‐k‐trees of k‐trees
• On the Mean Connected Induced Subgraph Order of Cographs
• Subtrees of graphs
• Maximizing the mean subtree order

This page was built for publication: On the Mean Order of Connected Induced Subgraphs of Block Graphs