• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

On families of partially ordered sets which have the common structure of upper or lower bounds and the character of graphs which represents them

Research Project

Project/Area Number 16540115
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionBUNKYO University

Principal Investigator

ERA Hiroshi  BUNKYO University, Information and communication, Professor, 情報学部, 教授 (60185147)

Co-Investigator(Kenkyū-buntansha) NEMOTO Toshio  BUNKYO University, Information and Communication, Assistant Professor, 情報学部, 助教授 (40286026)
HOTTA Keisuke  BUNKYO University, Information and Communication, Lecturer, 情報学部, 講師 (80327022)
Project Period (FY) 2004 – 2005
Project Status Completed (Fiscal Year 2005)
Budget Amount *help
¥3,700,000 (Direct Cost: ¥3,700,000)
Fiscal Year 2005: ¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 2004: ¥2,100,000 (Direct Cost: ¥2,100,000)
KeywordsApplied Mathematics / Graph Theory / Partially ordered set / upper bound graph / poset / 離散数学 / 組合せ論
Research Abstract

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 substructures
An 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.

Report

(3 results)
  • 2005 Annual Research Report   Final Research Report Summary
  • 2004 Annual Research Report
  • Research Products

    (5 results)

All 2005 2004

All Journal Article (5 results)

  • [Journal Article] On upper bound graph with forbidden subposets2005

    • Author(s)
      Hiroshi Era, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya
    • Journal Title

      Electronic Notes in DISCRETE MATHMATICS 22

      Pages: 107-111

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2005 Final Research Report Summary
  • [Journal Article] On upper bound graph with forbidden subposets2005

    • Author(s)
      Hiroshi Era, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya
    • Journal Title

      Electronic Notes in DISCRETE MATHEMATICS 22

      Pages: 107-111

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Note on construction methods of upper bound graphs2004

    • Author(s)
      Hiroshi Era, Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya
    • Journal Title

      AKCE International Journal of Graphs and Combinatorics Volume 1・No.2

      Pages: 103-108

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2005 Final Research Report Summary
  • [Journal Article] Note on construction methods of upper bound graphs2004

    • Author(s)
      Hiroshi Era, Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya
    • Journal Title

      AKCE International Journal of Graphs and Combinatorics Volume 1, No.2

      Pages: 103-108

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2005 Final Research Report Summary
  • [Journal Article] Note on Construction Methods of Upper Bound Graphs2004

    • Author(s)
      H.Era, S-I.Iwai, K.Ogawa, M.Tsuchiya
    • Journal Title

      AKCE International Journal of Graphs and Combinatorics vol1,No.2

      Pages: 103-108

    • Related Report
      2004 Annual Research Report

URL: 

Published: 2004-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi