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 条

[21] The question of the collapsibility of random 3-regular graphs
Spencer, JJ
DISCRETE MATHEMATICS, 2001, 230 (1-3) : 253 - 253
[22] THE MAXIMUM GENUS OF A 3-REGULAR SIMPLICIAL GRAPH
Li Deming\ Liu Yanpei
AppliedMathematics:AJournalofChineseUniversities, 1999, (02) : 81 - 92
[23] Largest 2-Regular Subgraphs in 3-Regular Graphs
Ilkyoo Choi
Ringi Kim
Alexandr V. Kostochka
Boram Park
Douglas B. West
Graphs and Combinatorics, 2019, 35 : 805 - 813
[24] Sampling Edge Covers in 3-Regular Graphs
Bezakova, Ivona
Rummler, William A.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 137 - 148
[25] On a class of Hamiltonian laceable 3-regular graphs
Alspach, B
Chen, CC
McAvaney, K
DISCRETE MATHEMATICS, 1996, 151 (1-3) : 19 - 38
[26] On a class of Hamiltonian laceable 3-regular graphs
Alspach, Brian
Chen, C.C.
McAvaney, Kevin
1996, Elsevier (151) : 1 - 3
[27] On 3-regular 4-ordered graphs
Meszaros, Karola
DISCRETE MATHEMATICS, 2008, 308 (11) : 2149 - 2155
[28] The maximum genus of a 3-regular simplicial graph
Deming L.
Yanpei L.
Applied Mathematics-A Journal of Chinese Universities, 1999, 14 (2) : 203 - 214
[29] EVERY 4-REGULAR GRAPH PLUS AN EDGE CONTAINS A 3-REGULAR SUBGRAPH
ALON, N
FRIEDLAND, S
KALAI, G
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (01) : 92 - 93
[30] Random railways modeled as random 3-regular graphs
Garmo, H
RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (1-2) : 113 - 136

← 1 2 3 4 5 →