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 382 Documents
Complete multipartite graphs of non-QE class Nobuaki Obata
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): 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.2023.11.2.14

Abstract

We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in Euclidean spaces. Moreover, we prove that there are exactly four primary non-QE graphs among the complete multipartite graphs.
Symmetric colorings of G × Z_2 Jabulani Phakathi; Yevhen Zelenyuk; Yuliya Zelenyuk
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): 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.2023.11.2.3

Abstract

Let G be a finite group and let r ∈ N. An r-coloring of G is any mapping χ : G → {1, …, r}. A coloring χ is symmetric if there is g ∈ G such that χ(gx−1g)=χ(x) for every x ∈ G. We show that if f(r) is the polynomial representing the number of symmetric r-colorings of G, then the number of symmetric r-colorings of G × Z2 is f(r2).
On z-cycle factorizations with two associate classes where z is 2a and a is even Joshua Lambert; Michael Tiemeyer
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): 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.2023.11.2.9

Abstract

Let K = K(a, p; λ1, λ2) be the multigraph with: the number of parts equal to p; the number of vertices in each part equal to a; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. The existence of C4-factorizations of K has been settled when a is even; when a ≡ 1 (mod 4) with one exception; and for very few cases when a ≡ 3 (mod 4). The existence of Cz-factorizations of K has been settled when a ≡ 1 (mod z) and λ1 is even, and when a ≡ 0 (mod z). In this paper, we give a construction for Cz-factorizations of K for z = 2a when a is even.
On balance and consistency preserving 2-path signed graphs Kshittiz Chettri; Biswajit Deb; Anjan Gautam
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): 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.2023.11.2.4

Abstract

Let Σ = (G, σ) be a balanced and canonically consistent signed graph. The 2-path signed graph Σ#Σ = (G2, σ′) of Σ has the underlying graph as G2 and the sign σ′(uv) of an edge uv in it is −1 whenever in each uv-path of length 2 in Σ all edges are negative; otherwise σ′(uv) is 1. Here, G2 is the graph obtained from G by adding an edge between u and v if there is a path of length 2 between them. In this article, we have investigated balancedness and canonically consistency of 2-path signed graphs Σ#Σ of a balanced and canonically consistent signed graph Σ. The problem has been resolved completely for cycles, star graphs and trees.
The dominating partition dimension and locating-chromatic number of graphs Muhammad Ridwan; Hilda Assiyatun; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): 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.2023.11.2.10

Abstract

For every graph G, the dominating partition dimension of G is either the same as its partition dimension or one higher than its partition dimension. In this paper, we consider some general connections among these three graph parameters: partition dimension, locating-chromatic number, and dominating partition dimension. We will show that βp(G)≤ηp(G)≤χL(G) for any graph G with at least 3 vertices. Therefore, we will derive properties for which graphs G have ηp(G)=βp(G) or ηp(G)=βp(G)+1.
On 14-regular distance magic graphs Kovář, Petr; Krbeček, Matěj
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): 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.2024.12.1.4

Abstract

Let G be a graph with n vertices. By N(v) we denote the set of all vertices adjacent to v. A bijection f : V(G)→{1, 2, …, n} is a distance magic labeling of G if there exists an integer k such that the sum of labels of all vertices adjacent to v is k for all vertices v in V(G). A graph which admits a distance magic labeling is a distance magic graph. In this paper, we completely characterize all orders for which a 14-regular distance magic graph exists. Hereby we extended similar results on 2-, 4-, 6-, 8-, 10-, and 12-regular distance magic graphs.
The dispersability of the Kronecker cover of the product of complete graphs and cycles Shao, Zeling; Cui, Yaqin; Li, Zhiguo
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): 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.2024.12.1.10

Abstract

The Kronecker cover of a graph G is the Kronecker product of G and K2. The matching book embedding of a graph G is an embedding of G with the vertices on the spine, each edge within a single page so that the edges on each page do not intersect and the degree of vertices on each page is at most one. The matching book thickness of G is the minimum number of pages in a matching book embeddding of G and it denoted by mbt(G). A graph G is dispersable if mbt(G)=Δ(G), nearly dispersable if mbt(G)=Δ(G)+1. In this paper, the dispersability of the Kronecker cover of the Cartesian product of complete graphs Kp and cycles Cq is determined.
Forbidden family of Ph-magic graphs Maryati, Tita Khalis; Hadiputra, Fawwaz Fakhrurrozi; Salman, A. N. M.
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): 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.2024.12.1.5

Abstract

Let G be a simple, finite, and undirected graph and H be a subgraph of G. The graph G admits an H-covering if every edge in G belongs to a subgraph isomorphic to H. A bijection f : V(G)∪E(G)→[1, n] is a magic total labeling if for every subgraphs H′ isomorphic to H, the sum of labels of all vertices and edges in H′ is constant. If there exists such f, we say G is H-magic. A graph F is said to be a forbidden subgraph of H-magic graphs if F ⊆ G implies G is not an H-magic graph. A set that contains all forbidden subgraph of H-magic is called forbidden family of H-magic graphs, denoted by F(H). In this paper, we consider F(Ph), where Ph is a path of order h. We present some sufficient conditions of a graph being a member of F(Ph). Besides that, we show the uniqueness of a minimal tree which belongs to F(P3) and characterize P3-(super)magic trees.
The local metric dimension of amalgamation of graphs Fitriani, Dinny; Saputro, Suhadi Wido
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): 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.2024.12.1.11

Abstract

For any two adjacent vertices u and v in graph G, a set of vertices W locally resolves a graph G if the distance of u and v to some elements of W are distinct. The local metric dimension of G is the minimum cardinality of local resolving sets of G. For n ∈ N and i ∈ {1, 2, …, n}, let Hi be a simple connected graph containing a connected subgraph J. Let H = {H1, H2, …, Hn} be a finite collection of simple connected graphs. The subgraph-amalgamation of H = {H1, H2, …, Hn}, denoted by Subgraph − Amal{H; J}, is a graph obtained by identifying all elements of H in J. The subgraph J is called as a terminal subgraph of H. In this paper, we determine general bounds of the local metric dimension of subgraph-amalgamation graphs for any connected terminal subgraphs. We also determine the local metric dimension of Subgraph − Amal{H; J} for J is either K1 or P2.
Edge-locating coloring of graphs Korivand, Meysam; Mojdeh, Doost Ali; Baskoro, Edy Tri; Erfanian, Ahmad
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): 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.2024.12.1.6

Abstract

An edge-locating coloring of a simple connected graph G is a partition of its edge set into matchings such that the vertices of G are distinguished by the distance to the matchings. The minimum number of the matchings of G that admits an edge-locating coloring is the edge-locating chromatic number of G, and denoted by χ′L(G). This paper introduces and studies the concept of edge-locating coloring. Graphs G with χ′L(G)∈{2, m} are characterized, where m is the size of G. We investigate the relationship between order, diameter and edge-locating chromatic number. We obtain the exact values of χ′L(Kn) and χ′L(Kn − M), where M is a maximum matching; indeed this result is also extended for any graph. We determine the edge-locating chromatic number of the join graphs of some well-known graphs. In particular, for any graph G, we show a relationship between χ′L(G + K1) and Δ(G). We investigate the edge-locating chromatic number of trees and present a characterization bound for any tree in terms of maximum degree, number of leaves, and the support vertices of trees. Finally, we prove that any edge-locating coloring of a graph is an edge distinguishing coloring.

Filter by Year

2013 2025


Filter By Issues
All Issue 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