Kong, Jing and Wu, Yaokun - On economical set representations of graphs

dmtcs:451 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, Vol. 11 no. 2
On economical set representations of graphs

Authors: Kong, Jing and Wu, Yaokun

In this paper we discuss the bounds of and relations among various kinds of intersection numbers of graphs. Especially, we address extremal graphs with respect to the established bounds. The uniqueness of the minimum-size intersection representations for some graphs is also studied. In the course of this work, we introduce a superclass of chordal graphs, defined in terms of a generalization of simplicial vertex and perfect elimination ordering.

Source : oai:HAL:hal-00988208v1
Volume: Vol. 11 no. 2
Section: Graph and Algorithms
Published on: January 1, 2009
Submitted on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Browsing statistics

This page has been seen 62 times.
This article's PDF has been downloaded 96 times.