Convex Accessibility Number of the Complements and Some Binary Operations of Graphs

被引：0
|
作者：
Samson, Harold B. [1 ]
Aniversario, Imelda S. [2 ]
Luga, Mary Joy F. [3 ]
机构：
[1] Mindanao State Univ, Iligan Inst Technol, Iligan 9200, Philippines
[2] Mindanao State Univ, Iligan Inst Technol, Coll Sci & Math, Dept Math & Stat, Iligan 9200, Philippines
[3] Mindanao State Univ, Iligan Inst Technol, Integrated Dev Sch, Coll Educ, Iligan 9200, Philippines
来源：
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2024年 / 17卷 / 04期
关键词：
H-Convex Accessibility Number; Convex Subgraph; Strong Product; Cartesian Product; Complement of a Graph; Accessibility Number;
D O I：
10.29020/nybg.ejpam.v17i4.5332
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This study explores various aspects of the Convex Accessibility Number in graph theory, focusing on some binary operations namely Cartesian Product and Strong Product and Complements of graphs. The computation of the Convex Accessibility Number of Cartesian Product and Strong Product of graphs is examined. Also, the Convex Accessibility Number of the Complement of some known graphs is explored. Through these investigations, this study contributes to a deeper understanding of the Convex Accessibility Number in graph theory, offering insights into its behavior under different graph operations and Complementation scenarios.
引用
收藏
页码：2930 / 2938
页数：9
相关论文
共 50 条
  • [1] Convex Roman Dominating Functions on Graphs under some Binary Operations
    Fortosa, Rona Jane G.
    Jamil, Ferdinand P.
    Canoy, Sergio R.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, 17 (02): : 1335 - 1351
  • [2] Outer-Convex Hop Domination in Graphs Under Some Binary Operations
    Isahac, Al-Amin Y.
    Hassan, Javier A.
    Laja, Ladznar S.
    Copel, Hounam B.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (04): : 2035 - 2048
  • [3] The induced path number of the complements of some graphs
    Broere, Izak
    Jonck, Elizabeth
    Domke, Gayla S.
    Markus, Lisa R.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 33 : 15 - 32
  • [4] Forcing Total dr-Power Domination Number of Graphs Under Some Binary Operations
    Armada, Cris L.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (03): : 1098 - 1107
  • [5] Convex Accessibility Polynomial of Graphs
    Luga-Samson, Mary Joy F.
    Rasid, Regimar A.
    Artes Jr, Rosalio G.
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2025, 20 (01): : 243 - 246
  • [6] Game chromatic number of some convex polytope graphs
    Bokhary, Syed Ahtsham Ul Haq
    Akhtar, Muhammad Shahzad
    UTILITAS MATHEMATICA, 2017, 104 : 15 - 22
  • [7] Resolving Domination in Graphs Under Some Binary Operations
    Monsanto, Gerald B.
    Rara, Helen M.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (01): : 18 - 28
  • [8] Distinguishing number and distinguishing index of some operations on graphs
    Alikhani, Saeid
    Soltani, Samaneh
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (05): : 1047 - 1059
  • [9] On zero forcing number of graphs and their complements
    Eroh, Linda
    Kang, Cong X.
    Yi, Eunjeong
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (01)
  • [10] TOTAL ACCESSIBILITY NUMBER OF GRAPHS
    Kilic, E.
    Dundar, P.
    NEURAL NETWORK WORLD, 2017, 27 (03) : 309 - 315
12345