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
 33   34   35   36   37 
The real equiangular tight frames obtained from rank 3 graphs Bannai, Eiichi; Bannai, Etsuko; Lee, Chin-Yen; Tanaka, Hajime; Yu, Wei-Hsuan
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.12

Abstract

We present all nontrivial real equiangular tight frames {φm}m=1M in RN obtained as spherical embeddings of primitive rank 3 graphs on M vertices, and those such that one of their associated M strongly regular graphs on M - 1 vertices is a primitive rank 3 graph.
Determination of all graphs whose eccentric graphs are clusters Akiyama, Jin; Kodate, Takako; Matsunaga, Kiyoko
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.1

Abstract

A disconnected graph G is called a cluster if G is not union of K2s (1-factor) but union of complete graphs of order at least two. J. Akiyama, K. Ando and D. Avis showed in Lemma 2.1 of [2] that G is equi-eccentric if the eccentric graph Ge is a cluster or pK2. And they also characterized all graphs whose eccentric graphs are complete graphs and pK2 in [2]. In this paper, we determined in Theorem 2 all graphs whose eccentric graphs are clusters, which is an extension of Lemma 2.1 in [2].  
Partition dimension of trees - palm approach Hafidh, Yusuf; Baskoro, Edy Tri
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.7

Abstract

The partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition. This reduces the problem of the partition dimension of trees into finding the partition dimension of palms, the end-paths from a branch. In this paper, we construct a resolving partition for trees using resolving partitions of their palms. We also study some bounds for the partition dimension of palms and also find the partition dimension of regular palm and olive trees.
Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs Abdallah, Mohamad
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.13

Abstract

The neighbor connectivity refers to the minimum number of vertices whose removal, along with their neighbors, causes a previously connected graph to become disconnected. In this paper we focus on Cayley graphs constructed from the symmetric group Sn. We investigate the bounds of the neighbor connectivity for two cases: when the generating graph is a tree, and when it is a unicyclic graph with a unique cycle of length m, specifically considering cases where m = 3, m = n - 1, or m = n.
On domination numbers of zero-divisor graphs of commutative rings Anderson, Sarah E.; Axtell, Mike; Kroschel, Brenda K.; Stickles, Jr., Joe A.
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.2

Abstract

Zero-divisor graphs of a commutative ring R, denoted Γ(R), are well-represented in the literature. In this paper, we consider domination numbers of zero-divisor graphs. For reduced rings, Vatandoost and Ramezani characterized the possible graphs for Γ(R) when the sum of the domination numbers of Γ(R) and the complement of Γ(R) is n - 1, n, and n + 1, where n is the number of nonzero zero-divisors of R. We extend their results to nonreduced rings, determine which graphs are realizable as zero-divisor graphs, and provide the rings that yield these graphs.
1-well-covered graphs containing a clique of size n∕3 Deniz, Zakir
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.8

Abstract

A graph is well-covered if all of its maximal independent sets have the same size. A graph that remains well-covered upon the removal of any vertex is called a 1-well-covered graph. These graphs, when they have no isolated vertices, are also known as W2 graphs. It is well-known that every graph G ∈ W2 has two disjoint maximum independent sets. In this paper, we investigate connected W2 graphs with n vertices that contain a clique of size n∕3. We prove that if the removal of two disjoint maximum independent sets from a graph G ∈ W2 leaves a clique of size at least 3, then G contains a clique of size n∕3. Using this result, we provide a complete characterization of these graphs, based on eleven graph families.
Rainbow connection number of corona product of graphs Septyanto, Fendy
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.14

Abstract

In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection number rc(G) is the smallest number of colors in a rainbow coloring of G. The corona product G ∘ H of two graphs G and H is constructed from one copy of G and n = |V (G)| disjoint copies of H such that the i-th vertex of G is joined to all vertices in the i-th copy of H, for each i ∈{1,…,n}. Several resuls on the rainbow connection number of corona product have been published, but there are inaccuracies. In this paper, we close the gaps and add new results. The strong variant of rainbow connection number is also discussed.
A new look at the concept of domination in hypergraphs Divya, P.M.; Ramakrishnan, T.V.; Arumugam, Subramanian
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.3

Abstract

In this paper we propose a new definition of domination in hypergraphs in such a way that when restricted to graphs it is the usual domination in graphs. Let H = (V,E) be a hypergraph. A subset S of V is called a dominating set of H if for every vertex v in V -S, there exists an edge e ∈ E such that v ∈ e and e-{v}⊆ S. The minimum cardinality of a dominating set of H is called the domination number of H and is denoted by γ(H). We determine the domination number for several classes of uniform hypergraphs. We characterise minimal dominating sets and introduce the concept of independence and irredundance leading to domination chain in hypergraphs.
Embedding partial 3-star designs Noble, Matt; Nochumson, Shayne
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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/jgta.2024.12.2.9

Abstract

Define a 3-star decomposition of Kn as being a collection of subgraphs, each isomorphic to K1,3, with the property that each edge of Kn appears in exactly one of the subgraphs. A partial 3-star decomposition is similarly defined except each edge appears in at most one of the subgraphs. In this work, it is shown that any partial 3-star decomposition of Kn can be embedded into a decomposition of Kn+s where s ≤ 4. Furthermore, we determine, for any maximal partial 3-star decomposition P of Kn, the minimum s ∈{1,2,3,4} such that P can be embedded into a decomposition of Kn+s.
On the incidence graph of circular spaces Sorgun, Sezer; Ertaş, Ali Gökhan; Günaltılı, İbrahim
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 2 (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.2.15

Abstract

A configuration of the triple (P,L,I) is an incidence relation which has the properties "any two points are incident with at most one line" and "any two lines are incident with at most one point". In projective geometry, bipartite graphs can be used as an incidence model between the points and lines of a configuration. The graphs associated with a space are a good tool for understanding the topological and geometric properties of space in abstract systems. In this paper we focus on the incidence graph of circular space and obtain its properties in terms of some pure graph invariants. We also characterize it in terms of the graphs associated with other spaces in the literature.

Page 35 of 39 | Total Record : 382

 33   34   35   36   37 

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