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
A note on isolate domination Ismail Sahul Hamid; S. Balamurugan; A. Navaneethakrishnan
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 4, No 1 (2016): 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/egta.2016.4.1.8

Abstract

A set $S$ of vertices of a graph $G$ such that $\left\langle S\right\rangle$ has an isolated vertex is called an \emph{isolate set} of $G$. The minimum and maximum cardinality of a maximal isolate set are called the \emph{isolate number} $i_0(G)$ and the \emph{upper isolate number} $I_0(G)$ respectively. An isolate set that is also a dominating set (an irredundant set) is an $\emph{isolate dominating set} \ (\emph{an isolate irredundant set})$. The \emph{isolate domination number} $\gamma_0(G)$ and the \emph{upper isolate domination number} $\Gamma_0(G)$ are respectively the minimum and maximum cardinality of a minimal isolate dominating set while the \emph{isolate irredundance number} $ir_0(G)$ and the \emph{upper isolate irredundance number} $IR_0(G)$ are the minimum and maximum cardinality of a maximal isolate irredundant set of $G$. The notion of isolate domination was introduced in \cite{sb} and the remaining were introduced in \cite{isrn}. This paper further extends a study of these parameters.   
Interlace polynomials of friendship graphs Christina Eubanks-Turner; Aihua Li
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 2 (2018): 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.2018.6.2.7

Abstract

In this paper, we study the interlace polynomials of friendship graphs, that is, graphs that satisfy the Friendship Theorem given by Erdös, Rényi and Sos. Explicit formulas, special values and behavior of coefficients of these polynomials are provided. We also give the interlace polynomials of other similar graphs, such as, the butterfly graph.
On the distance domination number of bipartite graphs Doost Ali Mojdeh; Seyed Reza Musawi; Esmaeil Nazari
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 2 (2020): 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.2020.8.2.11

Abstract

‎A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within distance k from some vertex of D‎. ‎The minimum cardinality among all k-distance dominating sets of G is called the k-distance domination number of G. ‎In this note we give upper bounds on the k-distance domination number of a connected bipartite graph‎, ‎and improve some results have been given like Theorems 2.1 and 2.7 in [Tian and Xu‎, ‎A note on distance domination of graphs‎, ‎Australasian Journal of Combinatorics‎, ‎43 (2009)‎, ‎181-190]‎. 
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey Hebert Perez-Roses
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 2, No 2 (2014): 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.2014.2.2.9

Abstract

This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.
Self-dual embeddings of K_{4m,4n} in different orientable and nonorientable pseudosurfaces with the same Euler characteristic Steven Schluchter; J. Z. Schroeder
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 5, No 2 (2017): 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.2017.5.2.8

Abstract

A proper embedding of a graph G in a pseudosurface P is an embedding in which the regions of the complement of G in P are homeomorphic to discs and a vertex of G appears at each pinchpoint in P;  we say that a proper embedding of G in P is self dual if there exists an isomorphism from G to its dual graph.  We give an explicit construction of a self-dual embedding of the complete bipartite graph K_{4m,4n} in an orientable pseudosurface for all $m, n\ge 1$; we show that this embedding maximizes the number of umbrellas of each vertex and has the property that for any vertex v of K_{4m,4n}, there are two faces of the constructed embedding that intersect all umbrellas of v.  Leveraging these properties and applying a lemma of Bruhn and Diestel, we apply a surgery introduced here or a different known surgery of Edmonds to each of our constructed embeddings for which at least one of m or n is at least 2.  The result of these surgeries is that there exist distinct orientable and nonorientable pseudosurfaces with the same Euler characteristic that feature a self-dual embedding of K_{4m,4n}.
Harary index of bipartite graphs Hanyuan Deng; Selvaraj Balachandran; Suresh Elumalai; Toufik Mansour
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 7, No 2 (2019): 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.2019.7.2.12

Abstract

Let G be a connected graph with vertex set V(G). The Harary index of a graph is defined as H(G) = ∑u ≠ v 1/d(u, v), where d(u, v) denotes the distance between u and v. In this paper, we determine the extremal graphs with the maximum Harary index among all bipartite graphs of order n with a given matching number, with a given vertex-connectivity and with a given edge-connectivity, respectively.
Size multipartite Ramsey numbers for stripes versus small cycles Chula Janak Jayawardene; Edy Tri Baskoro; Lilanthi Samarasekara; Syafrizal Sy
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 4, No 2 (2016): 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.2016.4.2.4

Abstract

For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as the smallest natural number $s$ such that any arbitrary two coloring of the graph $K_{j \times s}$ using the colors red and blue, contains a red $G_1$ or a blue $G_2$ as subgraphs. In this paper, we obtain the exact values of the size Ramsey numbers $m_j(nK_2, C_m)$ for $j \ge 2$ and $m \in \{3,4,5,6\}$.
On distance signless Laplacian spectrum and energy of graphs Abdollah Alhevaz; Maryam Baghipur; Ebrahim Hashemi
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 2 (2018): 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.2018.6.2.12

Abstract

The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G‎, ‎defined as ‎D‎Q(G) = Tr(G) + D(G)‎, ‎where D(G) is the distance matrix of G and Tr(G) is the diagonal matrix of vertex transmissions of G‎. ‎In this paper we determine some upper and lower bounds on the distance signless Laplacian spectral radius of G based on its order and independence number‎, ‎and characterize the extremal graph‎. ‎In addition‎, ‎we give an exact description of the distance signless Laplacian spectrum and the distance signless Laplacian energy of the join of regular graphs in terms of their adjacency spectrum‎.
Total vertex irregularity strength for trees with many vertices of degree two Rinovia Simanjuntak; Susilawati Susilawati; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 2 (2020): 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.2020.8.2.17

Abstract

For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different vertices x and y, wt(x) ≠ wt(y), where wt(x) = φ(x)+ Σ????xy∈E(G) φ(xy). The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. In this paper, we provide three possible values of total vertex irregularity strength for trees with many vertices of degree two. For each of the possible values, sufficient conditions for trees with corresponding total vertex irregularity strength are presented.
Graphs obtained from collections of blocks Colton Magnant; Pouria Salehi Nowbandegani; Hua Wang
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 3, No 1 (2015): 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.2015.3.1.6

Abstract

Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially.  It is known that if $d \geq 3$, such block graphs can have arbitrarily large chromatic number.  We prove that the chromatic number can be bounded with only a mild restriction on the sizes of the blocks.  We also show that block graphs of block configurations arising from partitions of $d$-dimensional hypercubes into sub-hypercubes are at least $d$-connected.  Bounds on the diameter and the hamiltonicity of such block graphs are also discussed.

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