English

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 n7n \ge 7, the star K1,n1K_{1,n-1} has maximum mean connected induced subgraph order, and for n3n \ge 3, the nn-skillet, K1+(K1Kn2)K_1+(K_1 \cup K_{n-2}), 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 1/21/2. The mean order of all connected induced subgraphs containing a given vertex vv of a cograph GG, called the local mean of GG at vv, is shown to be at least as large as the mean order of all connected induced subgraphs of GG, called the global mean of GG.

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