A Characterization of Semi Bound Graphs

Hiroshi, Era, and Kenjiro, Ogawa, and Morimasa, Tsuchiya, (2004) A Characterization of Semi Bound Graphs. Bulletin of the Malaysian Mathematical Sciences Society, 27 (1). pp. 27-33. ISSN 0126-6705

Full text not available from this repository.

Official URL: http://math.usm.my/bulletin/pdf/v27n1/v27n1p4.pdf

Affiliations

Bunkyo University, Faculty of Information and Communication
Tokai University, Dept. of Mathematical Sciences
Masachusette Institute of Technology, Cambridge, Dept. of Mathematics

Abstract

In this paper we deal with semi bound graphs. For a poset $P$ , a graph $G$ is a semi bound graph of $P$ if $V(G) = V(P)$ and $uv \in E(G)$ if and only if there exists a common upper bound of $u$ and $v$ or a common lower bound of $u$ and $v$ in $P$ . We also obtain characterizations of triangle-free semi bound graphs and $k_4$ -free semi bound graphs.

Item Type:	Journal
Subjects:	Q Science, Computer Science
ID Code:	1373

Repository Staff Only: item control page

Help Contact Us Privacy Policy

© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.