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
 23   24   25   26   27 
On some subclasses of interval catch digraphs Sanchita Paul; Shamik Ghosh
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.10

Abstract

A digraph G = (V, E) is an interval catch digraph if for each vertex v ∈ V, one can associate an interval on real line and a point within it (say (Iv, pv)) in such a way that uv ∈ E if and only if pv ∈ Iu. It was introduced by Maehara in 1984. It has many applications in real world situations like networking and telecommunication. In his introducing paper Maehara proposed a conjecture for the characterization of central interval catch digraph (where pv is the mid-point Iv for each v ∈ V) in terms of forbidden subdigraphs. In this paper, we disprove the conjecture by showing counter examples. Also we characterize this digraph by defining a suitable mapping from the vertex set to the real line. We study oriented interval catch digraphs and characterize an interval catch digraph when it is a tournament. Finally, we characterize a proper interval catch digraph and establish relationships between these digraph classes.
Perfect 2-colorings of the generalized Petersen graph GP(n,3) Hamed Karami
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.16

Abstract

In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n, 3), where n ≥ 7. We also give some basic results for GP(n, k).
Multi-bridge graphs are anti-magic Yu Bin Tai; Gek Ling Chia; Poh-Hwa Ong
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.22

Abstract

An anti-magic graph  is a graph whose |E| edges  can be labeled with the first  |E| natural numbers such that each edge receives a distinct number and each vertex receives a distinct vertex sum which is obtained by taking the sum of the labels of all the edges incident to it. We prove that the multi-bridge graph is anti-magic.
Simultaneously dominating all spanning trees of a graph Sebastian Johann; Sven O. Krumke; Manuel Streicher
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.5

Abstract

We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover. Using this fact we present an exact algorithm that finds a simultaneous dominating set of minimum size using an oracle for finding a minimum vertex cover. The algorithm can be implemented to run in polynomial time on several graph classes, such as bipartite or chordal graphs. We prove that there is no polynomial time algorithm that finds a minimum simultaneous dominating set on perfect graphs unless P=NP. Finally, we provide a 2-approximation algorithm for finding a minimum simultaneous dominating set.
Matching book thickness of generalized Petersen graphs Zeling Shao; Huiru Geng; Zhiguo Li
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.11

Abstract

The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular. The matching book thickness of G is the minimum number of pages required for any matching book embedding of G, denoted by mbt(G). In this paper, the matching book thickness of generalized Petersen graphs is determined.
Zeroth-order general Randić index of trees with given distance k-domination number Tomas Vetrik; Mesfin Masre; Selvaraj Balachandran
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.17

Abstract

The zeroth-order general Randić index of a graph G is defined as Ra(G)=∑v ∈ V(G)dGa(v), where a ∈ ℝ, V(G) is the vertex set of G and dG(v) is the degree of a vertex v in G. We obtain bounds on the zeroth-order general Randić index for trees of given order and distance k-domination number, where k ≥ 1. Lower bounds are given for 0 < a < 1 and upper bounds are given for a < 0 and a > 1. All the extremal graphs are presented which means that our bounds are the best possible.
Computer search for graceful labeling: a survey Ljiljana Brankovic; Michael J. Reynolds
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.23

Abstract

This paper surveys the main computer search results for finding graceful labeling of trees. The paper is devoted to the memory of Mirka Miller, who made an outstanding contribution to the area of graph labeling.
A survey on enhanced power graphs of finite groups Xuanlong Ma; Andrei Kelarev; Yuqing Lin; Kaishun Wang
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.6

Abstract

We survey known results on enhanced power graphs of finite groups. Open problems, questions and suggestions for future work are also included.
The matrix Jacobson graph of finite commutative rings Siti Humaira; Pudji Astuti; Intan Muchtadi-Alamsyah; Ahmad Erfanian
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.12

Abstract

The notion of the matrix Jacobson graph was introduced in 2019. Let R be a commutative ring and J(R) be the Jacobson radical of ring R. The matrix Jacobson graph of ring R size m × n, denoted ????(R)m × n, is defined as a graph where the vertex set is Rm × n ∖ J(R)m × n such that two distinct vertices A, B are adjacent if and only if 1 − det(AtB) is not a unit in ring R. Here we obtain some graph theoretical properties of ????(R)m × n including its connectivity, planarity and perfectness.
Regular handicap graphs of order n ≡ 4 (mod 8) Dalibor Froncek; Aaron Shepanik
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (2022): 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.2022.10.1.18

Abstract

A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, …, n} with the property that f(xi)=i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1),w(x2),…,w(xn) forms an increasing arithmetic progression. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagic labeling. We construct r-regular handicap distance antimagic graphs of order n ≡ 4 (mod 8) for all feasible values of r.

Page 25 of 39 | Total Record : 382

 23   24   25   26   27 

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