Maximum Subgraph Problem for 3-Regular Knodel graphs and its Wirelength

被引：2
|
作者：
Rajan, R. Sundara [1 ]
Reji, Remi Mariam [1 ]
Rajalaxmi, T. M. [2 ]
机构：
[1] Hindustan Inst Technol & Sci, Dept Math, Chennai 603103, India
[2] Sri Sivasubramaniya Nadar Coll Engn, Dept Math, Chennai 603110, India
来源：
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2023 | 2023年 / 13947卷
关键词：
Maximum subgraph problem; Edge congestion; Wirelength; Linear arrangement; Knodel graph;
D O I：
10.1007/978-3-031-25211-2_31
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The maximum subgraph problem (MSP) of a graph is the estimation of the greatest number of edges in the induced subgraph of all subsets of the vertex set of the same cardinality. The Knodel graph W-Delta,W-n of n vertices and the highest degree Delta lies in [1, left perpendicularlog(2)(n)right perpendicular], where n is even, is a minimum linear gossip graph and with minimum broadcasting. In this paper, we will obtain the maximum subgraph of the 3-regular Knodel graph W-3,W-n, n >= 16, n is even, and thereby obtain its wirelength.
引用
收藏
页码：403 / 414
页数：12
相关论文
共 50 条
  • [1] 3-REGULAR PATH PAIRABLE GRAPHS
    FAUDREE, RJ
    GYARFAS, A
    LEHEL, J
    GRAPHS AND COMBINATORICS, 1992, 8 (01) : 45 - 52
  • [2] An identity involving 3-regular graphs
    Woodall, DR
    DISCRETE MATHEMATICS, 1996, 152 (1-3) : 287 - 293
  • [3] 3-REGULAR PARTS OF 4-REGULAR GRAPHS
    TASHKINOV, VA
    MATHEMATICAL NOTES, 1984, 36 (1-2) : 612 - 623
  • [4] On Rewriting of Planar 3-Regular Graphs
    Tomita, Kohji
    Ikeda, Yasuwo
    Hosono, Chiharu
    INFORMATICS ENGINEERING AND INFORMATION SCIENCE, PT III, 2011, 253 : 346 - +
  • [5] An identity involving 3-regular graphs
    Department of Mathematics, University of Nottingham, Nottingham, NG7 2RD, United Kingdom
    Discrete Math, 1-3 (287-293):
  • [6] 3-REGULAR SUBGRAPHS OF 4-REGULAR GRAPHS
    CHVATAL, V
    FLEISCHNER, H
    SHEEHAN, J
    THOMASSEN, C
    JOURNAL OF GRAPH THEORY, 1979, 3 (04) : 371 - 386
  • [7] ISOMORPHIC FACTORIZATION OF REGULAR GRAPHS AND 3-REGULAR MULTIGRAPHS
    ELLINGHAM, MN
    WORMALD, NC
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1988, 37 : 14 - 24
  • [8] Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs
    Suil, O.
    West, Douglas B.
    DISCRETE APPLIED MATHEMATICS, 2015, 190 : 163 - 168
  • [9] The maximum acyclic subgraph problem and degree-3 graphs
    Newman, A
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2001, 2129 : 147 - 158
  • [10] 3-regular graphs are 2-reconstructible
    Kostochka, Alexandr, V
    Nahvi, Mina
    West, Douglas B.
    Zirlin, Dara
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 91
12345