On the Mean Connected Induced Subgraph Order of Cographs

zbMath1404.05103arXiv1708.01916MaRDI QIDQ4616101

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

Publication date: 30 January 2019

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

zbMATH Keywords

connected induced subgraphs of cographsglobal mean of a graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (7)

A lower bound on the average size of a connected vertex set of a graph ⋮ The average size of a connected vertex set of a graph—Explicit formulas and open problems ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ 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

• Unnamed Item
• Indistinguishable trees and graphs
• Computing residual connectedness reliability for restricted networks
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• Uniformly optimal graphs in some classes of graphs with node failures
• Complement reducible graphs
• The shape of node reliability
• On the average number of nodes in a subtree of a tree
• The Complexity of the Residual Node Connectedness Reliability Problem
• On the Local and Global Means of Subtree Orders
• On reliability of graphs with node failures
• On the roots of the node reliability polynomial
• Maximizing the mean subtree order

This page was built for publication: On the Mean Connected Induced Subgraph Order of Cographs