The structure character of essentially disconnected polyomino graphs

被引：2
|
作者：
Liu Zhifang [2 ]
Rongsi, C. [1 ]
机构：
[1] Fuzhou Univ, Ctr Discrete Math & Theoret Comp Sci, Fuzhou 350002, Fujian, Peoples R China
[2] Fujian Jiangxia Coll, Dept Informat Technol, Fuzhou, Fujian, Peoples R China
来源：
JOURNAL OF MATHEMATICAL CHEMISTRY | 2011年 / 49卷 / 02期
关键词：
Construction; Polyomino graph; Matching; Fixed bond; Essentially disconnected; Normal; POLYNOMIALS;
D O I：
10.1007/s10910-010-9754-7
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
This paper deals with the structure of essentially disconnected polyomino graphs. It is proved that for an essentially disconnected polyomino graph, the normal components induced digraph is acyclic and connected. The lower bond for the number of normal components of an essentially disconnected polyomino graph is investigated. Moreover, the essentially disconnected polyomino graphs with two or three normal components are classified and constructed.
引用
收藏
页码：489 / 506
页数：18
相关论文
共 50 条
  • [31] ON RECONSTRUCTING DISCONNECTED GRAPHS
    CHARTRAND, G
    KRONK, HV
    ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1970, 175 (01) : 85 - +
  • [32] On α-labeling of disconnected graphs
    Youssef, Maged Z.
    ARS COMBINATORIA, 2015, 123 : 329 - 338
  • [33] Determination of essentially disconnected sites in the boundary of coronoid subgraphs
    Morikawa, T
    Gutman, I
    Chen, RS
    Cyvin, SJ
    POLYCYCLIC AROMATIC COMPOUNDS, 1998, 12 (04) : 269 - 279
  • [34] The Number of Normal Components of Essentially Disconnected Coronoid Systems
    Ke, Xiaoling
    POLYCYCLIC AROMATIC COMPOUNDS, 2016, 36 (02) : 89 - 105
  • [35] RECOGNIZING ESSENTIALLY DISCONNECTED BENZENOIDS WITH FIXED DOUBLE BONDS
    LIN KERONG
    S. J. CYVIN
    B. N. CYVIN
    CHEN RONGSI(Department of Mathematics
    AppliedMathematics:AJournalofChineseUniversities(SeriesB), 1994, (03) : 299 - 305
  • [36] Perfect matchings in random polyomino chain graphs
    Wei, Shouliu
    Ke, Xiaoling
    Lin, Fenggen
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2016, 54 (03) : 690 - 697
  • [37] Perfect matchings in random polyomino chain graphs
    Shouliu Wei
    Xiaoling Ke
    Fenggen Lin
    Journal of Mathematical Chemistry, 2016, 54 : 690 - 697
  • [38] A linear algorithm for a perfect matching in polyomino graphs
    Lin, Yuqing
    Zhang, Fuji
    THEORETICAL COMPUTER SCIENCE, 2017, 675 : 82 - 88
  • [39] Essentially infinite colourings of graphs
    Bollobás, B
    Kohayakawa, Y
    Schelp, RH
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2000, 61 : 658 - 670
  • [40] Symmetric layout of disconnected graphs
    1600, 21st Century COE Program: Information Research Center for Development of Knowledge Society Infrastructure; Casio Science Promotion Foundation; International Communications Foundation; Kansai Chapter of the Information Processing Society of Japan; Kansai Research Foundation for Technology Promotion; Telecommunications Advancement Foundation (Springer Verlag):
12345