Electronic Journal of Graph Theory and Applications (EJGTA)
Journal published by Indonesian Combinatorial Society
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
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.
Articles
1–20 of 129 results.
-
The hyper-Zagreb index of a simple connected graph G is defined by ${\chi ^2}(G) = \sum_{uv \in E(G)} {{{\left( {d(u) + d(v)} \right)}^2}}$. In this paper, we establish, analyze and compare some new u...
-
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the ineq...
-
Let $0<n\in\mathbb{Z}$. In the unit distance graph of $\mathbb{Z}^n\subset\mathbb{R}^n$, a perfect dominating set is understood as having induced components not necessarily trivial. A modification ...
-
Given a group G, the intersection power graph of G, denoted by $\mathcal{G}_I(G)$, is the graph with vertex set G and two distinct vertices x and y are adjacent in $\mathcal{G}_I(G)$ if there exists ...
-
Let G be a simple graph of order n. The domination polynomial of G is the polynomial $D(G, x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where d(G,i) is the number of dominating sets of G of size i and $\g...
-
We give some reduction formulas for computing the Tutte polynomial of any graph with parallel classes. Several examples are given to illustrate our results.
-
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of G. Following th...
-
Let G=(V,E) be a simple connected graph. A subset S of V is called a neighbourhood set of G if $G=\bigcup_{s\in S}<N[s]>$, where N[v] denotes the closed neighbourhood of the vertex v in G. Furth...
-
We give a new construction of Ramanujan graphs using a generalized type of covering graph called a weighted covering graph. For a given prime p the basic construction produces bipartite Ramanujan grap...
-
In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in computational linguistics, decision making so...
-
A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently, if the distance matrix is conditionally negative definite. Several criteria for a g...
-
Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as $\sum_{\{x,y\}\subseteq V(G)}deg(x)deg(y)d(x, y)$, where deg(x) is the degree of vertex x in G and d(x, y) is t...
-
For a simple graph G, a vertex labeling f:V(G)\to {1, 2, ..., k} is called a k-labeling. The weight of a vertex v, denoted by $wt_f(v)$ is the sum of all vertex labels of vertices in the closed neigh...
-
In this paper we consider node labelings c of an undirected connected graph G=(V,E) with labels {1,2,... ,|V|}, which induce a list distance c(u,v)=|c(v)-c(u)| besides the usual graph distance d(u,v)....
-
A $k$-partite $r$-digraph(multipartite multidigraph) (or briefly MMD)($k\geq 3$, $r\geq 1$) is the result of assigning a direction to each edge of a $k$-partite multigraph that is without loops and co...
-
Journal article Electronic Journal of Graph Theory and Applications • 2018V.G. Vizing showed that any graph belongs to one of two classes: Class 1 if χʹ(G) = Δ(G) or in class 2 if χʹ(G) = Δ(G) + 1, where χʹ(G) and Δ(G) denote the edge chromatic index of G and the maximum de...
-
Journal article Electronic Journal of Graph Theory and Applications • 2018Let G be a non-abelian group. The non-commuting graph of group G, shown by ΓG, is a graph with the vertex set G \ Z(G), where Z(G) is the center of group G. Also two distinct vertices of a and b are a...
-
Journal article Electronic Journal of Graph Theory and Applications • 2018For a simple graph G = (V, E) this paper deals with the existence of an edge labeling φ : E(G) → {0, 1, …, k − 1}, 2 ≤ k ≤ ∣E(G)∣, which induces a vertex labeling φ * : V(G) → {0, 1, …, k − 1} in suc...
-
Journal article Electronic Journal of Graph Theory and Applications • 2018A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). I...
-
Journal article Electronic Journal of Graph Theory and Applications • 2018We correct a small error in a 1996 paper of Albertson and Haas, and extend their lower bound for the fraction of properly colorable edges of planar subcubic graphs that are simple, connected, bridgele...
English