On the Mean Connected Induced Subgraph Order of Cographs
Combinatorics
2017-08-08 v1
Abstract
In this article the extremal structures for the mean order of connected induced subgraphs of cographs are determined. It is shown that among all connected cographs of order , the star has maximum mean connected induced subgraph order, and for , the -skillet, , has minimum mean connected induced subgraph order. It is deduced that the density for connected cographs (i.e. the ratio of the mean to the order of the graph) is asymptotically . The mean order of all connected induced subgraphs containing a given vertex of a cograph , called the local mean of at , is shown to be at least as large as the mean order of all connected induced subgraphs of , called the global mean of .
Keywords
Cite
@article{arxiv.1708.01916,
title = {On the Mean Connected Induced Subgraph Order of Cographs},
author = {Matthew E. Kroeker and Lucas Mol and Ortrud R. Oellermann},
journal= {arXiv preprint arXiv:1708.01916},
year = {2017}
}
Comments
24 pages