@Article{ATA-34-2,
author = {},
title = {On Potentially Graphical Sequences of $G−E(H)$},
journal = {Analysis in Theory and Applications},
year = {2018},
volume = {34},
number = {2},
pages = {187--198},
abstract = {<p style="text-align: justify;">A loopless graph on $n$ vertices in which vertices are connected at least by $a$ and at most by $b$ edges is called a $(a,b,n)$-graph. A $(b,b,n)$-graph is called $(b,n)$-graph
and is denoted by $K^b_n$ (it is a complete graph), its complement by $\overline{K}^b_n$. A non increasing
sequence $π = (d_1,···,d_n)$ of nonnegative integers is said to be $(a,b,n)$ graphic if it
is realizable by an $(a,b,n)$-graph. We say a simple graphic sequence $π = (d_1,···,d_n)$ is
potentially $K_4−K_2\cup K_2$-graphic if it has a a realization containing an $K_4−K_2\cup K_2$ as a
subgraph where $K_4$ is a complete graph on four vertices and $K_2\cup K_2$ is a set of independent
edges. In this paper, we find the smallest degree sum such that every $n$-term
graphical sequence contains $K_4−K_2\cup K_2$ as subgraph.</p>},
issn = {1573-8175},
doi = {https://doi.org/10.4208/ata.2018.v34.n2.8},
url = {https://global-sci.com/article/73861/on-potentially-graphical-sequences-of-geh}
}