Showing papers in "AKCE International Journal of Graphs and Combinatorics in 2021"

TL;DR: This paper aims to demonstrate the efforts towards in-situ applicability of EMMR-II, which aims to provide real-time information about the response of the immune system to EMTs.

TL;DR: The zero-divisor graph of R, denoted by Γ(R), is a non-zero graph of a commutative ring R with nonzero identity as mentioned in this paper.

TL;DR: For an integer n ≥ 2, the additive power graph Γapq(G) of G is the simple undirected graph with vertex set G in which two distinct vertices x and y ar...

TL;DR: The subject of mutually orthogonal Latin squares (MOLSs) has fascinated researchers for many years as mentioned in this paper, and many open problems remain to which open problems need to be solved.

TL;DR: In this article, the authors define a total k-labeling φ of a graph G as a combination of an edge labeling φe:E(G)→{1,2,…,ke} and a vertex labelling φv:V(G), such that φ(x)=φv(x) if x∈ V(G).

TL;DR: This paper provides an infinite family of odd regular graphs possessing an orientable Z n -distance magic labeling and presents a family of even regular graphs that are not orientableZ n - distance magic.

TL;DR: In this article, Nikiforov defined the adjacency matrix of the convex combination of convex combinations of D(G) and A(G), where G is a simple connected graph.

TL;DR: In this paper, the oblique asymptote of the energy function for all connected cubic circulant graphs is computed and shown to be an upper bound for the energy of a given graph.

TL;DR: It is proved that the path-friendship graphs are also DLS, which means that if a friendship graph and a starlike tree are joined by merging their vertices of degree greater than 2, then the resulting graph is called a path- Friendship graph.

TL;DR: In this article, the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code is defined and a metric dimension of a simple connected graph is defined.

TL;DR: An antimagic labeling of a graph G with q edges is an injective mapping f:E(G)→{1,2,…,q} such that the induced vertex label for each vertex is different, where the vertex label of a vertex...

TL;DR: A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set { 0, 1, 2, …, Z n, m...

TL;DR: In this paper, the main goal of the paper is to answer an unsolved problem, which is to define a multicone graph as the join of a clique and a regular graph.

TL;DR: For a finite dimensional vector space V over a field F, the subspace sum graph of V is defined to be a simple undirected graph with vertex set as the set of all non-trivial proper proper vertices as discussed by the authors.

TL;DR: A graphoidal cover of a graph G (not necessarily finite) is a collection of paths in G, called ψ-edges, satisfying the following axioms: (GC-1) Ever... as mentioned in this paper.

TL;DR: In this paper, the resolving vector of a connected graph with an order imposed on it is defined as the k-vector of a subset of the graph with respect to a given order.

TL;DR: The k-maximal ideal hypergraph HΓk(R) to R with vertex set C(R,k) is the set of all kmaximal ideals in R and for distinct ideals as mentioned in this paper.

TL;DR: A local edge coloring of a graph is a proper edge coloring such that for each subset S of E(G) with 2≤|S|≤3, there exist edges e,f∈S such that |c(e)−c(f)|≥ns, where ns is th... as mentioned in this paper.

TL;DR: By exploiting the geometry of compression, this article proved that this function is a function modeling an l-step self-avoiding walk, and they introduced and studied the needle function (Γa→1°Vm)°⋯°(Γ a→l 2°vm):Rn→Rn.

TL;DR: For a vertex v of G and a subset S of V(G), the distance between v and S is d(v, S) = min{d(v,x),x∈S}. Given an ordered k-partition Π={S1,S2,…,Sk} of G, the represent...