cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
,
INDONESIA
Electronic Journal of Graph Theory and Applications (EJGTA)
ISSN : 23382287     EISSN : -     DOI : -
Core Subject : Engineering,
The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society (InaCombS), Graph Theory and Applications (GTA) Research Group - The University of Newcastle - Australia, and Faculty of Mathematics and Natural Sciences - Institut Teknologi Bandung (ITB) Indonesia. Subscription to EJGTA is free. Full-text access to all papers is available for free. All research articles as well as surveys and articles of more general interest are welcome. All papers will be refereed in the normal manner of mathematical journals to maintain the highest standards. This journal is sponsored by CARMA (Computer-Assisted Research Mathematics and its Applications) Priority Research Centre - The University of Newcastle - Australia, and Study Program of Information System- University of Jember - Indonesia.
Arjuna Subject : -
Articles 413 Documents
On locating-dominating set of subgraph-amalgamation graphs Darmaji Darmaji; Suhadi Wido Saputro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.2.7

Abstract

The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ V(G) such that for every two distinct vertices u, v ∈ V(G) ∖ W, ∅ ≠ NG(u) ∩ W ≠ NG(v) ∩ W ≠ ∅. For n ∈ ℕ and i ∈ {1, 2, …, n}, let Hi be a simple connected graph containing a connected subgraph J. Let ℋ = {H1, H2, …, Hn} be a finite collection of simple connected graphs. The subgraph-amalgamation of ℋ = {H1, H2, …, Hn} in J, denoted by Subgraph-Amal{ℋ; J}, is a graph obtained by identifying all elements of ℋ in J. The subgraph J is called as a terminal subgraph of ℋ. In this paper, we determine general bounds of the locating-dominating number of subgraph-amalgamation graphs for any connected terminal subgraphs. We also determine the locating-dominating number of the vertex-amalgamation graph, which is Subgraph-Amal{ℋ; J} where J is K1.
On the dominating partition dimension of Möbius ladders and burger graphs Ketut Queena Fredlina; Pritta Etriana Putri; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.2.13

Abstract

Let G be a connected graph and let Π = {S1, S2, …, Sk} be a partition of V(G). The partition Π is called a dominating resolving partition of G if distinct vertices have distinct distance representations with respect to Π, and every vertex has a neighbor in a partition class different from its own. The minimum number of classes in such a partition is called the dominating partition dimension of G, denoted by ηp(G). In this paper, we determine the dominating partition dimension of two families of cubic graphs: Möbius ladders and burger graphs with range one. We show that the dominating partition dimension is equal to 4 for both families within the specified ranges.
Anti-van der Waerden numbers of graph products with trees Zhanar Berikkyzy; Joe Miller; Elizabeth Sprangel; Shanise Walker; Nathan Joel Warnberg
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.2.2

Abstract

Given a graph G, an exact r-coloring of G is a surjective function c : V(G) → [1, …, r]. An arithmetic progression in G of length j with common difference d is a set of vertices {v1, …, vj} such that d(vi, vi+1) = d for 1 ≤ i < j. An arithmetic progression is rainbow if all of the vertices are colored distinctly. The fewest number of colors that guarantees a rainbow arithmetic progression of length three is called the anti-van der Waerden number of G and is denoted aw(G, 3). It is known that for any connected graphs G and H on two or more vertices we have 3 ≤ aw(G □ H, 3) ≤ 4. A tree is called 3-peripheral if it has three vertices that are pairwise diameter distance from one another. In this work we determine that aw(G □ T, 3) = 3 when T is 3-peripheral and G is any connected graph with |G| ≥ 2. We also determine that aw(T □ T′, 3) = 4 when T and T′ are not 3-peripheral and diam(T □ T′) is odd.

Filter by Year

2013 2026


Filter By Issues
All Issue Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications Vol 14, No 1 (2026): Electronic Journal of Graph Theory and Applications Vol 13, No 2 (2025): Electronic Journal of Graph Theory and Applications Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications Vol 12, No 2 (2024): Electronic Journal of Graph Theory and Applications Vol 12, No 1 (2024): Electronic Journal of Graph Theory and Applications Vol 11, No 2 (2023): Electronic Journal of Graph Theory and Applications Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications Vol 10, No 2 (2022): Electronic Journal of Graph Theory and Applications Vol 10, No 1 (2022): Electronic Journal of Graph Theory and Applications Vol 9, No 2 (2021): Electronic Journal of Graph Theory and Applications Vol 9, No 1 (2021): Electronic Journal of Graph Theory and Applications Vol 8, No 2 (2020): Electronic Journal of Graph Theory and Applications Vol 8, No 1 (2020): Electronic Journal of Graph Theory and Applications Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications Vol 7, No 1 (2019): Electronic Journal of Graph Theory and Applications Vol 6, No 2 (2018): Electronic Journal of Graph Theory and Applications Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications Vol 5, No 2 (2017): Electronic Journal of Graph Theory and Applications Vol 5, No 1 (2017): Electronic Journal of Graph Theory and Applications Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications Vol 4, No 1 (2016): Electronic Journal of Graph Theory and Applications Vol 3, No 2 (2015): Electronic Journal of Graph Theory and Applications Vol 3, No 1 (2015): Electronic Journal of Graph Theory and Applications Vol 2, No 2 (2014): Electronic Journal of Graph Theory and Applications Vol 2, No 1 (2014): Electronic Journal of Graph Theory and Applications Vol 1, No 2 (2013): Electronic Journal of Graph Theory and Applications Vol 1, No 1 (2013): Electronic Journal of Graph Theory and Applications More Issue