Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

ON GLOBAL VERTEX-EDGE DOMINATION OF JOIN AND CORONA OF SIMPLE GRAPHS

Authors

  • Cristover N. Vidal
  • Analen A. Malnegro

Keywords:

domination, vertex-edge domination, global vertex-edge domination

DOI:

https://doi.org/10.17654/0974165825024

Abstract

A subset $S$ of the vertex set $V(G)$ of a graph $G$ is a vertex-edge dominating set of $G$ if, for all edges $e \in E(G)$, there exists a vertex $v \in S$ that vertex-edge dominates $e$. If the same set $S$ is a vertex-edge dominating set of the complement $\bar{G}$ of $G$, then $S$ is called a globalvertex edge dominating set of $G$. The minimum cardinality of a global vertex-edge dominating set is called a global vertex-edge domination number of $G$, denoted by $\gamma_{g v e}(G)$. This paper characterises global vertex-edge dominating sets of join and corona of graphs. Bounds for global vertex-edge domination numbers are also determined.

Received: January 26, 2025
Revised: February 12, 2025
Accepted: March 6, 2025

References

S. Chitra and R. Sattanathan, Global vertex-edge domination chain and its characterization, Journal of Discrete Mathematical Sciences and Cryptography 15(4-5) (2012), 259-268. https://doi.org/10.1080/09720529.2012.10698379.

S. Chitra and R. Sattanathan, Global vertex-edge domination sets in total graph and product graph of path cycle International Conference on Mathematical Modelling and Scientific Computation, India, 2012, pp. 68-77. https://doi.org/10.1007/978-3-642-28926-2_8.

T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, CRC Press, 1998. https://doi.org/10.1201/9781482246582.

T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs, Advanced Topics, CRC Press, 1998. https://doi.org/10.1201/9781315141428.

S. K. Jena and G. K. Das, Vertex-edge domination in unit disk graphs, Discrete Applied Mathematics 319 (2021), 351-361.

https://doi.org/10.1016/j.dam.2021.06.002.

K. W. Peters, Theoretical and Algorithmic Results on Domination and Connectivity, Clemson OPEN 2019.

https://open.clemson.edu/arv_dissertations/1412/.

E. Sampathkumar, The global domination number of a graph, Journal of Mathematical and Physical Sciences 23 (1989), 377-385.

R. Ziemann and P. Zylinski, Vertex-edge domination in cubic graphs, Discrete Mathematics 343 (2020), 112075, 1-14.

https://doi.org/10.1016/j.disc.2020.112075.

P. Zylinski, Vertex-edge domination in graphs, Aequationes Mathematicae 93(4) (2018), 735-742. https://doi.org/10.1007/s00010-018-0609-9.

Published

2025-03-11

Issue

Section

Articles

How to Cite

ON GLOBAL VERTEX-EDGE DOMINATION OF JOIN AND CORONA OF SIMPLE GRAPHS. (2025). Advances and Applications in Discrete Mathematics, 42(4), 381-389. https://doi.org/10.17654/0974165825024

Similar Articles

1-10 of 95

You may also start an advanced similarity search for this article.