IJPAM: Volume 102, No. 1 (2015)
COMPLETE GRAPHS WITHOUT EDGES OF CYCLES
Department of Mathematical Sciences
Hiratsuka 259-1292, JAPAN
Abstract. For a poset the strict-double-bound graph of is the graph on for which vertices and of are adjacent if and only if and there exist elements distinct from and such that and The strict-double-bound number of a graph is defined as . We obtain upper bounds of strict-double-bound numbers of .
Received: July 26, 2014
AMS Subject Classification: 05C62
Key Words and Phrases: strict-double-bound graph, strict-double-bound number, cycle
Download paper from here.
DOI: 10.12732/ijpam.v102i1.2 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 9 - 21