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 15 Documents
 1   2 
Search results for , issue "Vol 5, No 2 (2017): Electronic Journal of Graph Theory and Applications" : 15 Documents clear
Spanning k-ended trees of 3-regular connected graphs Hamed Ghasemian Zoeram; Daniel Yaqubi
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.4

Abstract

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 obtain sufficient conditions for spanning k-trees of 3-regular connected graphs. We give a construction sequence of graphs satisfying the condition. At the end, we present a conjecture about spanning k-ended trees of 3-regular connected graphs.
Bounds for the Laplacian spectral radius of graphs Kamal Lochan Patra; Binod Kumar Sahoo
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.10

Abstract

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 parameters like the number of vertices, the number of edges, degree sequence, average 2-degrees, diameter, covering number, domination number, independence number and other parameters.
Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah; Rinovia Simanjuntak
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.5

Abstract

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 \in E(G)$ and f(V(G)) = {1, 2, 3, ..., p}. The super edge-magic deficiency of a graph G is either the smallest nonnegative integer n such that G U nK_1 is super edge-magic or +~ if there exists no such integer n. In this paper, we study the super edge-magic deficiency of join product graphs. We found a lower bound of the super edge-magic deficiency of join product of any connected graph with isolated vertices and a better upper bound of the super edge-magic deficiency of join product of super edge-magic graphs with isolated vertices. Also, we provide constructions of some maximal graphs, ie. super edge-magic graphs with maximal number of edges.
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles Bryan Freyberg; Melissa Keranen
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.11

Abstract

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 $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the property that there is a $\mu \in Z_n$ (called the magic constant) such that w(x)= \sum_{y\in N_{G}^{+}(x)} \overrightarrow{\ell}(y) - \sum_{y\in N_{G}^{-}(x)} \overrightarrow{\ell}(y)= \mu$ for every x \in V(G). If for a graph G there exists an orientation $\overrightarrow{G}$ such that there is a directed Z_n-distance magic labeling $\overrightarrow{\ell}$ for $\overrightarrow{G}$, we say that G is orientable Z_n-distance magic and the directed Z_n-distance magic labeling $\overrightarrow{\ell}$ we call an orientable Z_n-distance magic labeling. In this paper, we find orientable Z_n-distance magic labelings of the Cartesian product of cycles. In addition, we show that even-ordered hypercubes are orientable Z_n-distance magic.
"Transit data"-based MST computation Thodoris Karatasos; Evi Papaioannou
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.6

Abstract

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 automatically transform real-world images to graphs and, then, compute Minimum Spanning Trees (MST) in them.We apply this framework and present an application which automatically computes efficient construction plans (for escalator or low-emission hot spots) for connecting all points of interest in cultural sites, i.e., archaeological sites, museums, galleries, etc, aiming to to facilitate global physical access to cultural heritage and artistic work and make it accessible to all groups of population.
Some classes of bipartite graphs induced by Gray codes I Nengah Suparta
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.12

Abstract

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, the Gray code is called cyclic, otherwise it is called non-cyclic. The numbers indicating bit positions in where two successive codewords differ in the list of Gray codes are called transition numbers, and the sequence of these all numbers is called the transition sequence of the Gray code. In this article, bit positions of a Gray code of length n will be counted from 1 up until n. If a graph with vertex set {1, 2, ..., n} having the property that two vertices i and j are adjacent in the graph if and only if, i and j are consecutive transitions in the transition sequence of a Gray code, then the graph is called induced by the Gray code. Some classes of bipartite graphs are shown to be induced by Gray codes. Particularly, we show that complete bipartite graphs are induced by Gray codes. 
On some aspects of the generalized Petersen graph V. Yegnanarayanan
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.1

Abstract

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 \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i u_{i+1} : i \in Z_p\} \cup \{u_i^\prime u_{i+k}^\prime \in Z_p\} \cup \{u_iu_i^\prime : i \in Z_p\}$. In this paper we probe its spectrum and determine the Estrada index, Laplacian Estrada index, signless Laplacian Estrada index, normalized Laplacian Estrada index, and energy of a graph. While obtaining some interesting results, we also provide relevant background and problems.
The competition numbers of Johnson graphs with diameter four Kijung Kim
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.7

Abstract

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).
On H-irregularity strengths of G-amalgamation of graphs Faraha Ashraf; Martin Baca; Andrea Semanicova-Fenovcikova; Ayesha Shabbir
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.13

Abstract

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 total k-labeling f: V(G) U E(G) \to {1, 2, ..., k} if for every two different subgraphs H' and H'' isomorphic to H there is $wt_{f}(H') \neq wt_{f}(H'')$, where $wt_{f}(H)= \sum \limits_{v\in V(H)} f(v) + \sum \limits_{e \in E(H)} f(e)$ is the associated H-weight. The minimum k for which the graph G has an H-irregular total k-labeling is called the total H-irregularity strength of the graph G.In this paper, we obtain the precise value of the total H-irregularity strength of G-amalgamation of graphs.
Open-independent, open-locating-dominating sets Suk J. Seo; Peter J. Slater
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.2

Abstract

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 given "intruder" vertex in V(G).  As with many applications of dominating sets, the set $D$ might be required to have a certain property for <D>, the subgraph induced by D (such as independence,  paired, or connected).  Recently  the study of independent locating-dominating sets and independent identifying codes was initiated.  Here we introduce the property of open-independence for open-locating-dominating sets.

Page 1 of 2 | Total Record : 15

 1   2 

Filter by Year

2017 2017


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