p-ISSN 2338-2287

# Electronic Journal of Graph Theory and Applications (EJGTA)

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory 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.

All research articles as well as surveys and articles of general interest are welcom... see more

Subjects: Mathematics & Statistics

Accreditation: Certified International Journal (Grade 1) by Ristekdikti with Accreditation No. 36b/E/KPT/2016.

41–60 of 129 results.

Electronic Journal of Graph Theory and Applications • 2017
A {\em retracting-free bidirectional circuit} in a graph $G$ is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the oppos...
Electronic Journal of Graph Theory and Applications • 2017
Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the si...
• Alain Valette
Electronic Journal of Graph Theory and Applications • 2017
For a finite connected graph $X$, we consider the graph $RX$ obtained from $X$ by associating a new vertex to every edge of $X$ and joining by edges the extremities of each edge of $X$ to the correspo...
Electronic Journal of Graph Theory and Applications • 2017
Let $G = (V,E)$ be a simple connected graph. Theeccentric-distance sum of $G$ is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\dsis the eccentricity of th...
• K. Pravas • A. Vijayakumar
Electronic Journal of Graph Theory and Applications • 2017
The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes...
• Thodoris Karatasos • Evi Papaioannou
Electronic Journal of Graph Theory and Applications • 2017
In this work, we present an innovative image recognition technique which is based on the exploitation of transit-data in images or simple photographs of sites of interest. Our objective is to automati...
• I. Nengah Suparta
Electronic Journal of Graph Theory and Applications • 2017
A Gray code of length n is a list of all binary words of length n such that each two successive codewords differ in only one bit position. If the first and the last codewords also share this property,...
• V. Yegnanarayanan
Electronic Journal of Graph Theory and Applications • 2017
Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup... • Kijung Kim Electronic Journal of Graph Theory and Applications • 2017 In 2010, Kim, Park and Sano studied the competition numbers of Johnson graphs. They gave the competition numbers of J(n,2) and J(n,3).In this note, we consider the competition number of J(n,4). • Faraha Ashraf • Martin Baca • Andrea Semanicova-Fenovcikova • Ayesha Shabbir Electronic Journal of Graph Theory and Applications • 2017 A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting H-covering admits an H-irregular... • Suk J. Seo • Peter J. Slater Electronic Journal of Graph Theory and Applications • 2017 A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex$v \in D$being the location of some form of a locating device, from which one can detect and precisely identify any give... • Steven Schluchter • J. Z. Schroeder Electronic Journal of Graph Theory and Applications • 2017 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 s... • Mustapha Aouchiche • Pierre Hansen Electronic Journal of Graph Theory and Applications • 2017 The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60--67] that$\eta \le n - D$, where$...
• Mehdi Alaeiyan • Ayoob Mehrabani
Electronic Journal of Graph Theory and Applications • 2017
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A_...
Electronic Journal of Graph Theory and Applications • 2017
In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings ...
• Amrita Acharyya • Jon M. Corson • Bikash Das
Electronic Journal of Graph Theory and Applications • 2017
We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions.The ...
• Hamed Ghasemian Zoeram • Daniel Yaqubi
Electronic Journal of Graph Theory and Applications • 2017
A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we ...
• Kamal Lochan Patra • Binod Kumar Sahoo
Electronic Journal of Graph Theory and Applications • 2017
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph ...
• Anak Agung Gede Ngurah • Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications • 2017
A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy... • Bryan Freyberg • Melissa Keranen Electronic Journal of Graph Theory and Applications • 2017 The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph$\overrightarrow{G}=(V,A)$of order n is a bijection$\overrigh...
per page