On families of partially ordered sets which have the common structure of upper or lower bounds and the character of graphs which represents them
On families of partially ordered sets which have the common structure of upper or lower bounds and the character of graphs which represents them
批准号:
16540115
负责人:
ERA Hiroshi
金额:
$2.37万
依托单位:
依托单位国家:
日本
项目类别:
Grant-in-Aid for Scientific Research (C)
财政年份:
2004
资助国家:
日本
项目状态:
已结题
起止时间:
2004 至 2005
中文摘要
点击翻译按钮获取中文摘要
英文摘要
In this research, we consider the characterizations of upper bound graphs of posets from various aspects. For a poset P, the upper bound graph of P is the graph G_p=(X,E), where an edge uv belongs to E iff there exists an element m of X such that m is an upper bound of u and v. F.R.McMorris and T.Zaslavsky show a characterization of upper bound graphs using the clique covering conception. Here we give different characterizations by constructive method and also by forbidden substructuresAn upper bound graph can be transformed into a nova by contractions and a nova can be transformed into an upper bound graph by splits. Where nova is a graph class obtained from a star K_<1.n> by replacing each edge with a complete graph with at least two edges. By these results, we get a characterization on upper bound graphs as follows.Let G be a connected graph. G is an upper bound graph if the graph obtained by successive contractions of adjacent non-simplicial vertices u and v satisfying the following conditions is a nova :(1)u and v are adjacent to a simplicial vertex of G.(2)there exist no pair of non-simplicial adjacent vertices x andy which are not adjacent to simlicial vertices of G satisfying ceirtain conditions.The second result is on the characterization of some restricted class of upper bound graphs by concept of forbidden subset in posets. For a poset P, a poset Q is an m-subposet of P iff (1)Q is a subposet of P and, (2)for any pair x,y of Q, x,y <=m for some m in P then there exists m' in Q with x,y <=m'. This definition is introduced by D.D.Scott in 1986. Using this concept we give the following results,(1)G is a split upper bound graph iff the canonical poset of G contain no poset P_<2K2> as an m-subposet.(2)G is a threshold upper bound graph iff the canonical poset of G contain no 2K_2 or P_w as m-subposets.(3)G is difference upper bound graph iff the canonical poset of G contain P_<2K2> or P^as m-subposets.where P_w and P^are certain elementary classes of posets.
期刊论文(10)
专著(0)
科研奖励(0)
会议论文
DOI:
--
发表时间:
2004
期刊:
AKCE International Journal of Graphs and Combinatorics Volume 1・No.2
影响因子:
--
作者:
[Hiroshi Era, Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya]
通讯作者:
Morimasa Tsuchiya
On upper bound graph with forbidden subposets
在带有禁止子集的上限图上
DOI:
--
发表时间:
2005
期刊:
Electronic Notes in DISCRETE MATHMATICS 22
影响因子:
--
作者:
[Hiroshi Era, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya]
通讯作者:
Morimasa Tsuchiya
海外基金