Yayın tarihi için JAEM 2021, Vol 11, Special Issue listeleme
Toplam kayıt 28, listelenen: 21-28
-
Revan weighted PI index on some product of graphs
(Işık University Press, 2021)In chemical graph thoery, PI index is an additive topological index which has been used to measure the characteristics of chemical compounds. In this paper we introduce the weighted version of PI index of graph called the ... -
Reciprocal version of product degree distance of cactus graphs
(Işık University Press, 2021)The reciprocal version of product degree distance is a product degree weighted version of Harary index defined for a connected graph G as RDD*(G) = Sigma({x, y}subset of V(G) )(d(G)(x).d(G)(y))/d(G)(x,y), where d(G)(x) is ... -
Bounds on hyper-status connectivity index of graphs
(Işık University Press, 2021)In this paper, we obtain the bounds for the hyper-status connectivity indices of a connected graph and its complement in terms of other graph invariants. In addition, the hyper-status connectivity indices of some composite ... -
Algorithmic complexity of isolate secure domination in graphs
(Işık University Press, 2021)A dominating set S is an Isolate Dominating Set (IDS) if the induced subgraph G[S] has at least one isolated vertex. In this paper, we initiate the study of new domination parameter called, isolate secure domination. An ... -
Vertex coloring edge weightings of some square graphs
(Işık University Press, 2021)A k-edge-weighting w of a graph G is an assignment of integer weight, w(e) ∈ {1, 2, . . . , k}, to each edge e. A k-edge-weighting w induces a vertex coloring c by defining c(u) = P u∼e w(e) for every u ∈ V (G), where u ∼ ... -
Both a graph and its complement are self-centered with identical radius
(Işık University Press, 2021)We show that a graph and its complement are self-centered with identical radius r only when r = 2. Further, we provide a construction of such a graph for any given order at least eight. -
The orientation number of three complete graphs with linkages
(Işık University Press, 2021)For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is d~(G) = min{d(D)|D ∈ D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we consider the problem of ... -
Cyclic orthogonal double covers of 6-regular circulant graphs by disconnected forests
(Işık University Press, 2021)An orthogonal double cover (ODC) of a graph H is a collection G = {Gv : v ∈ V (H)} of |V (H)| subgraphs of H such that every edge of H is contained in exactly two members of G and for any two members Gu and Gv in G, |E(Gu) ...