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 条
  • [31] On construction, classification and evaluation of certain two level non-isomorphic orthogonal arrays
    Angelopoulos, P.
    Koukouvinos, C.
    Lappas, E.
    International Journal of Applied Mathematics and Statistics, 2009, 15 (D09): : 63 - 72
  • [32] Generating Functionally Equivalent Programs Having Non-isomorphic Control-Flow Graphs
    Geraud, Remi
    Koscina, Mirko
    Lenczner, Paul
    Naccache, David
    Saulpic, David
    SECURE IT SYSTEMS, NORDSEC 2017, 2017, 10674 : 265 - 279
  • [33] On construction, classification and evaluation of certain two level non-isomorphic orthogonal arrays
    Angelopoulos, P.
    Koukouvinos, C.
    Lappas, E.
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2009, 15 (D09): : 63 - 72
  • [34] On the number of non-isomorphic (simple) k-gonal biembeddings of complete multipartite graphs
    Costa, Simone
    Pasotti, Anita
    ARS MATHEMATICA CONTEMPORANEA, 2024, 24 (04) : 1 - 24
  • [35] A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes
    Fujisaki, Tatsuya
    DISCRETE MATHEMATICS, 2008, 308 (14) : 2944 - 2948
  • [36] Chemical graph polynomials. Part 4. Non-isomorphic graphs with identical acyclic polynomials
    Ivanciuc, O
    REVUE ROUMAINE DE CHIMIE, 1998, 43 (12) : 1173 - 1179
  • [37] Algorithmic construction of catalogs of non-isomorphic two-level orthogonal designs for economic run sizes
    Sun, Don X.
    Li, William
    Ye, Kenny Q.
    STATISTICS AND APPLICATIONS, 2008, 6 (1-2): : 141 - 155
  • [38] DIVISOR EQUITABLY STRONG NON-SPLIT DIVISOR EQUITABLE DOMINATION IN GRAPHS
    Priyanka, G. B.
    Xavier, P.
    John, J. catherine grace
    MATHEMATICS IN APPLIED SCIENCES AND ENGINEERING, 2025,
  • [39] Finite groups with isomorphic non-commuting graphs have the same nilpotency property
    Shahverdi, Hamid
    JOURNAL OF ALGEBRA, 2024, 642 : 60 - 64
  • [40] Exhaustive set of non-isomorphic sub-graphs and its application to chemical structure elucidation using a IR spectroscopy database
    Piottukh-Peletsky, VN
    Korobeinicheva, IK
    Bogdanova, TF
    Molodtsov, SG
    Derendyaev, BG
    ANALYTICA CHIMICA ACTA, 2000, 409 (1-2) : 181 - 195
12345