
1by Ichishima, Rikio MuntanerBatle, Francesc A Oshima, Akito Published in Electronic journal of graph theory and applications (02.04.2020)“...A bipartite graph G with partite sets X and Y is called consecutively super edgemagic if there exists a bijective function f : V(G) ⋃ E(G) → {1,2,...,V(G) +...”

2by Diari Indriati W. Widodo Indah E. Wijayanti Kiki A. Sugeng Isnaini Rosyida Published in Electronic journal of graph theory and applications (01.10.2020)“...Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a...”

3by Michal Staš Published in Electronic journal of graph theory and applications (01.10.2020)“...The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4...”

4by Martina Furrer Norbert Hungerbühler Simon Jantschgi Published in Electronic journal of graph theory and applications (01.10.2020)“...Let G be a finite plane multigraph and G' its dual. Each edge e of G is interpreted as a resistor of resistance Re, and the dual edge e' is assigned the dual...”

5by Dimas Agus Fahrudin Suhadi Wido Saputro Published in Electronic journal of graph theory and applications (01.10.2020)“...A subset S of vertices in graph G is called a geodetic set if every vertex in V(G) \ S lies on a shortest path between two vertices in S. A subset S of...”

6by Rinovia Simanjuntak Susilawati Susilawati Edy Tri Baskoro Published in Electronic journal of graph theory and applications (01.10.2020)“...For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total klabeling of G if for every two different...”

7by Ruixue Zhang Fengming Dong Published in Electronic journal of graph theory and applications (01.10.2020)“...Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural...”

8by Hamideh Hasanzadeh Bashir Karim Ahmadidelir Published in Electronic journal of graph theory and applications (01.10.2020)“...For any nonabelian group G, the noncommuting graph of G, Γ=ΓG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with...”

9by Denny Riama Silaban Edy Tri Baskoro Saladin Uttunggadewa Published in Electronic journal of graph theory and applications (01.10.2020)“...Let F, G and H be simple graphs. A graph F is said a (G,H)arrowing graph if in any redblue coloring of edges of F we can find a red G or a blue H. The size...”

10by Martin Baca Kadarkarai Muthugurupackiam KM. Kathiresan S. Ramya Published in Electronic journal of graph theory and applications (01.10.2020)“...We introduce a modular irregularity strength of graphs as modification of the wellknown irregularity strength. We obtain some estimation on modular...”

11by Christian Barrientos Published in Electronic journal of graph theory and applications (01.10.2020)“...Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful...”

12by Joanna Cyman Tomasz Dzido Published in Electronic journal of graph theory and applications (01.10.2020)“...Let F, G and H be simple graphs. We say F → (G,H) if for every 2coloring of the edges of F there exists a red copy of G or a blue copy of H in F. The Ramsey...”

13by Abolfazl Poureidi Published in Electronic journal of graph theory and applications (01.10.2020)“...A function f:V → {0,1,2} is a total Roman dominating function (TRDF) on a graph G=(V,E) if for every vertex v ∈ V with f(v) = 0 there is a vertex u adjacent to...”

14by Miquel Àngel Fiol Safet Penjic Published in Electronic journal of graph theory and applications (01.10.2020)“...Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance...”

15by Peteris Daugulis Published in Electronic journal of graph theory and applications (01.10.2020)“...The article deals with the problem of finding vertexminimal graphs with a given automorphism group. We exhibit two undirected 16vertex graphs having...”

16by Sanhan Muhammad Salih Khasraw Ivan Dler Ali Rashad Rashid Haji Published in Electronic journal of graph theory and applications (01.10.2020)“...For a nonabelian group G, the noncommuting graph Γ of G is defined as the graph with vertexset GZ(G), where Z(G) is the center of G, and two distinct...”

17by I Nengah Suparta I Dewa M. Agus Ariawan Published in Electronic journal of graph theory and applications (01.10.2020)“...Two methods for expanding graceful trees are introduced. In constructing a larger graceful trees, these methods are based on a collection of certain graceful...”

18by Heather Newman Hector Miranda Rigoberto Flórez Darren A Narayan Published in Electronic journal of graph theory and applications (01.10.2020)“...The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In...”

19by Amrullah Amrullah Published in Electronic journal of graph theory and applications (01.10.2020)“...Finding the partition dimension of a graph is one of the interesting (and uncompletely solved) problems of graph theory. For instance, the values of the...”

20by Sasmita Barik Sonu Rani Published in Electronic journal of graph theory and applications (01.10.2020)“...Let G be a simple connected graph with vertex set {1,2,...,n} and di denote the degree of vertex i in G. The ABC matrix of G, recently introduced by Estrada,...”