cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
,
INDONESIA
Electronic Journal of Graph Theory and Applications (EJGTA)
Published by Indonesian Combinatorial Society
ISSN : 23382287     EISSN : -     DOI : -
Core Subject : Engineering,
Electrical & Electronics 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
 35   36   37   38   39 
Local edge antimagic chromatic number of comb products involving path graph Chandra, Ivana Joice; Silaban, Denny Riama
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.12

Abstract

Let G = (V, E) be a graph with n vertices and no isolated vertices. A local edge antimagic labeling of G is a bijection f : V(G)→{1, 2, …, n} such that the weights of any two adjacent edges in G are distinct, where the weight of an edge in G is defined as the sum of the labels of its end vertices. Such a labeling induces a proper edge coloring of G, with edge weights serving as the colors. The local edge antimagic chromatic number of G, denoted χ′lea(G), is the minimum number of colors used across all such labelings. In this paper, we investigate the local edge antimagic chromatic number of comb product graphs, focusing on the case where a path graph is combined with copies of other graphs—specifically paths, cycles, and ladders. The comb product of G and H, with respect to an assigned vertex, is constructed by taking one copy of G and |V(G)| copies of H and identifying the assigned vertex from the i-th copy of H to the i-th vertex of G.
Stars in forbidden triples generating a finite set of graphs with minimum degree four Kotani, Takafumi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.1

Abstract

For a family H of graphs, a graph G is said to be H-free if G contains no member of H as a induced subgraph. Let G4(H) denote the family of connected H-free graphs having minimum degree at least 4. In this paper, we characterize the families H of connected graphs with |H|=3 such that H contains a star and G4(H) is a finite family, except for the case where {K4, K1, n}⊆H with 3 ≤ n ≤ 4.
Pareto graphs Rey, Andrea Alejandra
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.7

Abstract

It is well-known that Pareto distribution and related generalizations have historically been considered suitable for modeling income and wealth distributions, among other fields. Nowadays, graphs can be used to model many types of relations and processes in physical, biological, social, and information systems. By combining both concepts, this paper introduces the notion of the Pareto graph and gives some sufficient conditions to determine the existence of a giant component. A simulation study is carried out to evaluate the performance of Pareto random graph generation. In addition, basic graph properties of this novel kind of graph are contrasted with well-known models for random graph generation. The results are applied to real-life data that come from social networks, under the assumption that the degree distribution is well fitted by a Generalized Pareto distribution and compared with the fitting by other heavy-tailed distributions.
The distance magic property and two families of Cartesian product graphs Headley, Patrick Thomas
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.13

Abstract

Let G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V. In this paper we show that the only distance magic graph of the form Kn□Cm is K1□C4, and that m = 4 if Cm□Kn, t is distance magic. Necessary conditions are given for C4□Kn, t to be distance magic when n > t. These conditions are shown to be sufficient when n and t are both even. We conclude with some examples of distance magic graphs of the form C4□Kn, t with n > t, in particular constructing an infinite sequence of non-isomorphic distance magic graphs of this type.
On the rainbow connection numbers of line, middle, and total graphs of wheels Yulianti, Lyra; Muhardiansyah, Muhardiansyah; Nazra, Admi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.2

Abstract

An edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow connected graph. Similarly defined, an edge-colored graph G is called strong rainbow connected if any two vertices in G are connected by a geodesic path whose no two of its edges are colored the same. The strong rainbow connection for G, denoted by src(G), is the smallest number of colors needed such that G be a strong rainbow connected graph. This paper considers the determination of the rainbow connection and strong rainbow connection numbers of the line graph, the middle graph, and the total graph of a wheel Wn on n + 1 vertices.
Bounds on Erdos - Faber - Lovász conjecture - the uniform and regular cases Hegde, Suresh M.; Dara, Suresh
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.8

Abstract

We consider the Erds - Faber - Lovász (EFL) conjecture for hypergraphs. This paper gives an upper bound for the chromatic number of r regular linear hypergraphs H of size n. If r ≥ 4, χ(H)≤1.181n and if r = 3, χ(H)≤1.281n.
New results on the degree-diameter problem for undirected graphs Comellas, Francesc
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): 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.2025.13.1.14

Abstract

This paper presents fourteen newly discovered largest undirected graphs with specified degree and diameter, identified since the publication of the comprehensive survey by M. Miller and J. Širáň (Electron. J. Combin. DS14, 2nd. edition. May 2013). These findings advance the longstanding investigation of the degree-diameter problem, a key topic in graph theory, and offer a fresh insight for both theoretical research and practical applications in network design and combinatorial optimization.
Maximum boundary independent broadcasts in graphs and trees Hoepner, Julia Ingrid; MacGillivray, Gary; Mynhardt, Christina
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): 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.2025.13.2.1

Abstract

A broadcast on a connected graph G is a function f : V(G)→{0, 1, ...,  diam(G)} such that f(v)≤e(v) (the eccentricity of v) for all v ∈ V. If dG(u, v)≥f(u)+f(v) for any pair of vertices u, v with f(u)>0 and f(v)>0, the broadcast is said to be boundary independent.We show that the maximum weight αbn(G) of a boundary independent broadcast can be bounded in terms of the independence number α(G), and prove that the maximum boundary independent broadcast problem is NP-hard. We investigate bounds on αbn(T) when T is a tree in terms of its order and the number of vertices of degree at least 3, and determine a sharp upper bound on αbn(T) when T is a caterpillar, giving αbn(T) exactly for certain families of caterpillars. We conclude by describing a polynomial-time algorithm to determine αbn(T) for a given tree T. 
On Ramsey (2K2, Wn)-minimal graphs of smallest order Fajri, Muhammad Rafif; Assiyatun, Hilda; Baskoro, Edy Tri
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): 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.2025.13.2.7

Abstract

The notation F → (H, G) means that if all edges of F are arbitrarily colored by red or blue, then either the subgraph of F induced by all red edges contains a graph H or the subgraph of F induced by all blue edges contains a graph G. Let R(H, G) denote the set of all graphs F satisfying F → (H, G) and for every e ∈ E(F), (F − e) ↛ (H, G). In this paper, we propose some properties of Ramsey (2K2, G)-minimal graph of smallest order, where G is a graph containing a dominating vertex. We also find all members of R(2K2, Wn) of smallest order for n ∈ [5,8].
Some properties of Cayley signed graphs on finite Abelian groups Iranmanesh, Mohammad A.; Moghaddami, Nasrin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 2 (2025): 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.2025.13.2.13

Abstract

This paper establishes explicit combinatorial characterizations for fundamental structural properties of Cayley signed graphs defined on finite Abelian groups. We derive precise necessary and sufficient conditions for balance, clusterability, and sign-compatibility of both these graphs and their line graphs. By leveraging the prime factorization structure of the underlying group G, we prove that the signed graph Σ is balanced precisely when 2 appears among the prime factors of G. Furthermore, we demonstrate that the line graph L(Σ) is balanced if and only if G ≅ ℤ2 × ℤ2α for α ∈ {1, 2}.

Page 37 of 39 | Total Record : 382

 35   36   37   38   39 

Filter by Year

2013 2025


Reset
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