NECESSARY AND SUFFICIENT CONDITIONS FOR UNIT GRAPHS TO BE HAMILTONIAN

被引：35
|
作者：
Maimani, H. R. [1 ,2 ]
Pournaki, M. R. [3 ]
Yassemi, S. [2 ,4 ]
机构：
[1] Shahid Rajaee Teacher Training Univ, Math Sect, Dept Basic Sci, Tehran, Iran
[2] Inst Res Fundamental Sci IPM, Sch Math, Tehran, Iran
[3] Sharif Univ Technol, Dept Math Sci, Tehran, Iran
[4] Univ Tehran, Coll Sci, Sch Math Stat & Comp Sci, Tehran, Iran
来源：
PACIFIC JOURNAL OF MATHEMATICS | 2011年 / 249卷 / 02期
关键词：
Hamiltonian cycle; Hamiltonian graph; finite ring; RINGS;
D O I：
10.2140/pjm.2011.249.419
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The unit graph corresponding to an associative ring R is the graph obtained by setting all the elements of R to be the vertices and defining distinct vertices x and y to be adjacent if and only if x + y is a unit of R. By a constructive method, we derive necessary and sufficient conditions for unit graphs to be Hamiltonian.
引用
收藏
页码：419 / 429
页数：11
相关论文
共 50 条
  • [31] HAMILTONIAN CYCLES IN REGULAR GRAPHS
    李皓
    ChineseScienceBulletin, 1989, (04) : 267 - 268
  • [32] Network reliability in hamiltonian graphs
    Llagostera, Pol
    Lopez, Nacho
    Comas, Carles
    DISCRETE OPTIMIZATION, 2021, 41
  • [33] Chromatic properties of hamiltonian graphs
    Bielak, Halina
    DISCRETE MATHEMATICS, 2007, 307 (11-12) : 1245 - 1254
  • [34] GRAPHS WITH FEW HAMILTONIAN CYCLES
    Goedgebeur, Jan
    Meersman, Barbara
    Zamfirescu, Carol T.
    MATHEMATICS OF COMPUTATION, 2020, 89 (322) : 965 - 991
  • [35] PANCYCLICITY OF HAMILTONIAN LINE GRAPHS
    VANBLANKEN, E
    VANDENHEUVEL, J
    VELDMAN, HJ
    DISCRETE MATHEMATICS, 1995, 138 (1-3) : 379 - 385
  • [36] CONNECTIVITY AND HAMILTONIAN CONNECTEDNESS OF GRAPHS
    ZHU, YJ
    WANG, ZX
    CHINESE SCIENCE BULLETIN, 1993, 38 (01): : 15 - 18
  • [37] ON THE CONSTRUCTION AND ENUMERATION OF HAMILTONIAN GRAPHS
    胡冠章
    李岷珊
    Applied Mathematics:A Journal of Chinese Universities, 1993, (01) : 25 - 31
  • [38] A sufficient condition for a balanced bipartite digraph to be hamiltonian
    Wang, Ruixia
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2017, 19 (03):
  • [39] The most general structure of graphs with hamiltonian or hamiltonian connected square
    Ekstein, Jan
    Fleischner, Herbert
    DISCRETE MATHEMATICS, 2024, 347 (01)
  • [40] Segment endpoint visibility graphs are Hamiltonian
    Hoffmann, M
    Tóth, CD
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 26 (01): : 47 - 68
12345