Electronic Journal of Graph Theory and Applications (EJGTA)

Journal published by Indonesian Combinatorial Society

www.ejgta.org

ebaskoro@math.itb.ac.id

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 welcome. All papers will be refereed in the normal manner of mathematical journals to maintain the highest scholarly standards.

The Electronic Journal of Graph Theory and Applications is sponsored by CARMA (Computer-Assisted Research Mathematics and its Applications) Priority Research Centre - The University of Newcastle - Australia, and The Study Program of Information Systems- University of Jember - Indonesia.

Subjects: Mathematics & Statistics

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

Articles

1–20 of 114 results.

  • New Bounds on the Hyper-Zagreb Index for the Simple Connected Graphs Download
    Suresh Elumalai • Toufik Mansour • Mohammad Ali Rostami
    • 2018
    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...
  • Upper Bounds on the Bondage Number of a Graph Download
    Vladimir Dimitrov Samodivkin
    • 2018
    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...
  • Rainbow Perfect Domination in Lattice Graphs Download
    Luis R. Fuentes • Italo J. Dejter • Carlos A. Araujo
    • 2018
    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 ...
  • On the Intersection Power Graph of a Finite Group Download
    Sudip Bera
    • 2018
    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 ...
  • Some Families of Graphs with No Nonzero Real Domination Roots Download
    Somayeh Jahari • Saeid Alikhani
    • 2018
    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...
  • Formulas for the Computation of the Tutte Polynomial of Graphs with Parallel Classes Download
    Eunice Mphako-Banda • Julian A. Allagan
    • 2018
    We give some reduction formulas for computing the Tutte polynomial of any graph with parallel classes. Several examples are given to illustrate our results.
  • On Maximum Signless Laplacian Estrada Index of Graphs with Given Parameters II Download
    Ramin Nasiri • Hamid Reza Ellahi • Gholam Hossein Fath-Tabar • Ahmad Gholami
    • 2018
    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...
  • On Classes of Neighborhood Resolving Sets of a Graph Download
    B. Sooryanarayana • Suma A. S.
    • 2018
    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...
  • Ramanujan Graphs Arising as Weighted Galois Covering Graphs Download
    Marvin Minei • Howard Skogman
    • 2018
    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...
  • Computing the Edge Irregularity Strengths of Chain Graphs and the Join of Two Graphs Download
    Ali Ahmad • Ashok Gupta • Rinovia Simanjuntak
    • 2018
    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...
  • Distance Matrices and Quadratic Embedding of Graphs Download
    Nobuaki Obata • Alfi Y. Zakiyyah
    • 2018
    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...
  • Computation of Gutman Index of Some Cactus Chains Download
    Ali Sadeghieh • Nima Ghanbari • Saeid Alikhani
    • 2018
    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...
  • On Inclusive Distance Vertex Irregular Labelings Download
    Martin Baca • Andrea Semanicova-Fenovcikova • S. Slamin • Kiki A. Sugeng
    • 2018
    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...
  • List Graphs and Distance-consistent Node Labelings Download
    Håkan Lennerstad • Mattias Eriksson
    • 2018
    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)....
  • On Imbalances In Multipartite Multidigraphs Download
    Uma Tul Samee • Shariefuddin Pirzada
    • 2018
    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...
  • All Trees Are Six-cordial Download
    Driscoll, Keith • Krop, Elliot • Nguyen, Michelle
    • 2017
    For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing edge-weights as the sum modulo $k$ of the labels on incident vertices ...
  • On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles Download
    Lusiani, Anie • Baskoro, Edy Tri • Saputro, Suhadi Wido
    • 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...
  • Spectra of Graphs and the Spectral Criterion for Property (T) Download
    Valette, Alain
    • 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...
  • The Eccentric-distance Sum of Some Graphs Download
    P, Padmapriya • Mathad, Veena
    • 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...
  • On an Edge Partition and Root Graphs of Some Classes of Line Graphs Download
    Pravas, K • Vijayakumar, A
    • 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...
per page