Construction of non-isomorphic families of Halin graphs with same split domination numbers

被引：0

作者：

Priyadharshini, M. ^{[1
]}

Anandhababu, D. ^{[1
]}

Anuradha, A. ^{[1
]}

机构：

[1] Department of Mathematics, SRM Institute of Science and Technology, Kattankulathur, Tamil Nadu, India

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2020年 / 2020卷 / 112期

关键词：

Combinatorial mathematics;

D O I：

暂无

中图分类号：

O144 [集合论]; O157 [组合数学（组合学）];

学科分类号：

070104 ;

摘要：

Split domination number of a graph is the cardinality of a minimum dominating set whose removal disconnects the graph. In this paper, we define a special family of Halin graphs and determine the split domination number of those graphs. We show that the construction yield non-isomorphic families of Halin graphs but with same split domination numbers. © 2020 Charles Babbage Research Centre. All rights reserved.

引用

页码：153 / 159

共 45 条

[41] A SIMPLE CONSTRUCTION GIVING THE 2 NON-ISOMORPHIC TRIANGLE-FREE 3-COLORED K16S
LAYWINE, C
MAYBERRY, JP
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 45 (01) : 120 - 124
[42] R-ORDERS IN A SPLIT ALGEBRA HAVE FINITELY MANY NON-ISOMORPHIC IRREDUCIBLE LATTICES AS SOON AS R HAS FINITE CLASS NUMBER
ROGGENKAMP, KW
CANADIAN MATHEMATICAL BULLETIN, 1971, 14 (03): : 405 - +
[43] Algorithm for determining whether various two-level fractional factorial split-plot row-column designs are non-isomorphic
Stapleton, Robert D.
JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2010, 80 (1-2) : 43 - 59
[44] Non split hop domination number for some mirror graphs and cartesian product of two distinct paths
G. Mahadevan
V. Vijayalakshmi
Selvam Avadayappan
The Journal of Analysis, 2019, 27 : 475 - 491
[45] Non split hop domination number for some mirror graphs and cartesian product of two distinct paths
Mahadevan, G.
Vijayalakshmi, V.
Avadayappan, Selvam
JOURNAL OF ANALYSIS, 2019, 27 (02): : 475 - 491

← 1 2 3 4 5 →