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 398 Documents
 36   37   38   39   40 
Graph-theoretic properties of inversion-transpositions Katanaga, Atsuko; Shiratama, Takahiro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.6

Abstract

Dénés established the connection between labeled trees in Graph Theory and factorizations of cyclic permutations by means of transpositions. In this paper, we introduce the notion of an inversion-transposition, which has both the properties of an inversion and a transposition. For a cyclic permutation, we define the graph associated with each minimal representation using only inversion-transpositions and consider the properties. The main result is that a spanning tree T reconstructs the original permutation if and only if the sum over all vertices v of the distance in T between v and σ(v) equals 2(n - 1), which provides a precise reconstruction criterion.
Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures Narayanasamy, Jothilakshmi; Ramanathan, Sundara Rajan; Rajasingh, Indra; Ryan, Joe
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.12

Abstract

The capability of one architecture to simulate another serves as the foundation for network comparison, with embedding playing a key role in analyzing these simulations. In architectural simulation, graph embedding is one of the most powerful techniques for executing parallel algorithms and modeling diverse interconnection networks. In our earlier work, we listed an open problem that the determination of wirelength for embeddings of complete multipartite graphs into line graphs of tree-based interconnection architectures, specifically k-ary trees, banana trees, and firecracker trees. In the present paper, we explicitly construct embeddings of complete k-partite graphs into the line graphs of these three architectures and derive exact wirelength expressions. Thus, this work partially resolves the open problem posed in [1]. These results contribute toward optimized VLSI layout design and efficient Network-on-Chip (NoC) architectures.
Homotopy covers of graphs Chih, Tien; Scull, Laura
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.1

Abstract

We develop a theory of ×-homotopy, fundamental groupoids and covering spaces that applies to non-simple graphs, generalizing existing results for simple graphs. We prove that ×-homotopies from finite graphs can be decomposed into moves that adjust at most one vertex at a time, generalizing the spider lemma of Chih & Scull (2021). We define a notion of homotopy covering map and develop a theory of universal covers and deck transformations, generalizing Matsushita (2017) and Tardif–Wroncha (2019) to non-simple graphs. We examine the case of reflexive graphs (each vertex having at least one loop). We also prove that these homotopy covering maps satisfy a homotopy lifting property for arbitrary graph homomorphisms, generalizing path lifting results of Matsushita and Tardif–Wroncha.
Labeled graph rearrangements on matched and star products Barghi, Amir; DeFord, Daryl
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.7

Abstract

In this paper we present enumerative results for Stirling numbers of the first kind for two graph products, the matched product and the m-star, using the combinatorial model of rearrangements. The kth Stirling number of the first kind for a simple graph G counts the number of ways to decompose G into exactly k vertex-disjoint cycles, including single vertices as 1-cycles, single edges as 2-cycles, and counting orientations for cycles of order three or higher. This naturally leads to the definition of the graphical factorial of G as the total number of such decompositions without any restrictions on the number of cycles involved. The matched product, motivated by a popular construction for modeling multiplex data, requires specifying a labeling of each component graph and naturally defines several families of graphs whose Stirling numbers of the first kind can be enumerated in terms of their component graphs. The m-star product of a graph G is defined as the join of G with the empty graph with m vertices. We compute the Stirling numbers of the first kind and factorials for the m-star of complete graphs, forests, and cycles, and we provide bounds for other families. The combinatorial proofs in the case of m-star products also motivate a generalization in terms of disjoint path decompositions of graphs, which provides another promising avenue of study.
The matching book embedding under some graph operations Shao, Zeling; Yao, Min; Li, Zhiguo
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.13

Abstract

The matching book embedding of a graph G is an embedding of G with the vertices on the spine, and 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 embedding of G, denoted by mbt(G). In this paper, the exact matching book thickness of the corona product between a dispersible or nearly dispersible graph and a simple graph is determined. Additionally, the dispersibility of the edge product of a cycle and a simple graph is obtained. Finally the matching book thickness of the comb product of two dispersible graphs is obtained.
The Edge Metric Dimension of the Comb Product of a Cycle and a Graph with a Dominant Vertex Mn, Abdilla Nurul Azisah; Hasmawati, Hasmawati; Nurwahyu, Budi; Hinding, Nurdin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.2

Abstract

In this paper, we determine the edge metric dimension of the comb product of a cycle graph and a simple graph containing a dominant vertex. This result generalizes previous findings on the edge metric dimension of the comb product of a cycle and a complete graph. We show that the edge metric dimension of Cn ▷ D, where D is a simple graph with a dominant vertex, equals the product of the order of Cn and the order of D reduced by two.
Coloring discrete pseudomanifolds Basak, Biplab; Doem, Vanny; Nahak, Chandal
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.8

Abstract

This paper presents three main results concerning the coloring of discrete d-pseudomanifolds: (1) the general chromatic bounds d+1 ≤ X(K) ≤ 2d+2 for any d-pseudomanifold K; (2) an improved bound X(K) ≤ 2d+1 for a d-pseudomanifold expressible as a join K = Sk + K', where Sk is a cyclic k-sphere and K' is a subpseudomanifold; (3) the optimal bound X(K) ≤ ⌈3(d+1)/2⌉, where ⌈-⌉ is a ceiling function, under the additional assumptions that the spherical join factor Sk is an even-cyclic k-sphere and its dimension k is sufficiently close to d.
Some properties of stepwise irregular graphs Bera, Somnath; Paul, Prithwineel; Subramanian, K.G.
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 1 (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.1.14

Abstract

Graphs in which the absolute difference between the degrees of any two adjacent vertices is exactly one, are called stepwise irregular (SI) graphs. We establish several properties of SI graphs. In particular, we show that SI graphs of different order and cyclomatic numbers can be constructed from an SI graph with a vertex of degree 1 or 2. Necessary conditions and sufficient conditions for a degree sequence to be SI graphic are obtained. Moreover, a necessary condition comparing the sum of the terms of a partition of SI graph and its conjugate partition is obtained. Properties of SI graphs under certain elementary graph operations are also investigated.

Page 40 of 40 | Total Record : 398

 36   37   38   39   40 

Filter by Year

2013 2026


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