A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph

Yoshio Sano
<span title="2012-05-12">2012</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yxooi3wjmbgqtbp7l4evjeuj4i" style="color: black;">Graphs and Combinatorics</a> </i> &nbsp;
The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. In 1978, F. S. Roberts defined the competition number k(G)
more &raquo; ... a graph G as the minimum number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G and it has been one of the important research problems in the study of competition graphs to characterize a graph by its competition number. In 1982, R. J. Opsut gave two lower bounds for the competition number of a graph. In this paper, we give a generalization of these two lower bounds for the competition number of a graph.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00373-012-1188-5">doi:10.1007/s00373-012-1188-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lgot2tjj2jfkdkgs22hdkwf6b4">fatcat:lgot2tjj2jfkdkgs22hdkwf6b4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090709151138/http://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1663.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/73/07/7307f93da0dd9ea6b226da9ee7bea0af65333d02.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00373-012-1188-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>