Keyword Index

A

  • ABC index Relationships between Randic index and other topological indices [(Articles in Press)]
  • Alliances Strong Alliances in Graphs [Volume 4, Issue 1, 2019, Pages 1-13]
  • Annihilating ideal of a ring Some results on the complement of a new graph associated to a commutative ring [Volume 2, Issue 2, 2017, Pages 119-138]
  • Approximation solutions Approximation Solutions for Time-Varying Shortest Path Problem [Volume 2, Issue 2, 2017, Pages 139-147]
  • APX-complete Complexity and approximation ratio of semitotal domination in graphs [Volume 3, Issue 2, 2018, Pages 143-150]
  • Augmented Zagreb index Relationships between Randic index and other topological indices [(Articles in Press)]

B

  • Bipartite graph Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
  • Branching Point On trees and the multiplicative sum Zagreb index [Volume 1, Issue 2, 2016, Pages 137-148]

C

  • Cartesian product On independent domination numbers of grid and toroidal grid directed graphs [Volume 4, Issue 1, 2019, Pages 71-77]
  • Cartesian product On the super domination number of graphs [Volume 5, Issue 2, 2020, Pages 83-96]
  • Cartesian product graphs On global (strong) defensive alliances in some product graphs [Volume 2, Issue 1, 2017, Pages 21-33]
  • Cartesian products Different-Distance Sets in a Graph [Volume 4, Issue 2, 2019, Pages 151-171]
  • Chained ring Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
  • Circular cone optimization A full Nesterov-Todd step interior-point method for circular cone optimization [Volume 1, Issue 2, 2016, Pages 83-102]
  • Circular cone programming Primal-dual path-following algorithms for circular programming [Volume 2, Issue 2, 2017, Pages 65-85]
  • Commutative rings The sum-annihilating essential ideal graph of a commutative ring [Volume 1, Issue 2, 2016, Pages 117-135]
  • Complemented graph Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
  • Corona product On the super domination number of graphs [Volume 5, Issue 2, 2020, Pages 83-96]
  • Covering nodes The topological ordering of covering nodes [Volume 5, Issue 1, 2020, Pages 55-60]

D

  • Defensive alliances On global (strong) defensive alliances in some product graphs [Volume 2, Issue 1, 2017, Pages 21-33]
  • Defensive alliances Strong Alliances in Graphs [Volume 4, Issue 1, 2019, Pages 1-13]
  • Degree distance Product version of reciprocal degree distance of composite graphs [Volume 3, Issue 1, 2018, Pages 25-35]
  • Di fferent-Distance Sets Different-Distance Sets in a Graph [Volume 4, Issue 2, 2019, Pages 151-171]
  • Digraph‎ Signed total Roman k-domination in directed graphs [Volume 1, Issue 2, 2016, Pages 165-178]
  • Digraphs Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs [Volume 1, Issue 1, 2016, Pages 1-13]
  • Digraphs The Italian domatic number of a digraph [Volume 4, Issue 1, 2019, Pages 61-70]
  • Digraphs A note on the Roman domatic number of a digraph [Volume 5, Issue 1, 2020, Pages 19-26]
  • Directed graph The topological ordering of covering nodes [Volume 5, Issue 1, 2020, Pages 55-60]
  • Directed graph Twin signed total Roman domatic numbers in digraphs [(Articles in Press)]
  • Distance-$k$ domination k-Efficient partitions of graphs [Volume 4, Issue 2, 2019, Pages 109-122]
  • Distance-degrees (of vertices) A study on some properties of leap graphs [Volume 5, Issue 1, 2020, Pages 9-17]
  • Distance (in Graphs) Peripheral Wiener Index of a Graph [Volume 2, Issue 1, 2017, Pages 43-56]
  • Domination game Paired-Domination Game Played in Graphs [Volume 4, Issue 2, 2019, Pages 79-94]
  • Domination number Hypo-efficient domination and hypo-unique domination [Volume 1, Issue 2, 2016, Pages 103-116]
  • Domination number On the signed Roman edge k-domination in graphs [Volume 2, Issue 1, 2017, Pages 57-64]
  • Domination number On the edge geodetic and edge geodetic domination numbers of a graph [Volume 5, Issue 1, 2020, Pages 41-54]
  • Domination number On the super domination number of graphs [Volume 5, Issue 2, 2020, Pages 83-96]
  • Double Roman domatic number Double Roman domination and domatic numbers of graphs [Volume 3, Issue 1, 2018, Pages 71-77]
  • Double Roman domination number Double Roman domination and domatic numbers of graphs [Volume 3, Issue 1, 2018, Pages 71-77]

E

  • Efficient Domination Hypo-efficient domination and hypo-unique domination [Volume 1, Issue 2, 2016, Pages 103-116]
  • Efficient Domination k-Efficient partitions of graphs [Volume 4, Issue 2, 2019, Pages 109-122]
  • Euclidean Jordan algebra A full Nesterov-Todd step interior-point method for circular cone optimization [Volume 1, Issue 2, 2016, Pages 83-102]
  • Euclidean Jordan algebra Primal-dual path-following algorithms for circular programming [Volume 2, Issue 2, 2017, Pages 65-85]

F

  • F-index Reformulated F-index of graph operations [Volume 2, Issue 2, 2017, Pages 87-98]
  • First general Zagreb index Reformulated F-index of graph operations [Volume 2, Issue 2, 2017, Pages 87-98]
  • Full-Newton step A full Nesterov-Todd step interior-point method for circular cone optimization [Volume 1, Issue 2, 2016, Pages 83-102]
  • Full-Newton step An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step [Volume 3, Issue 1, 2018, Pages 51-70]

G

H

  • Halin The locating-chromatic number for Halin graphs [Volume 2, Issue 1, 2017, Pages 1-9]
  • Hamming distance On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance [Volume 4, Issue 1, 2019, Pages 35-46]

I

  • Infeasible interiorpoint method An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step [Volume 3, Issue 1, 2018, Pages 51-70]
  • Interior point methods Primal-dual path-following algorithms for circular programming [Volume 2, Issue 2, 2017, Pages 65-85]
  • Interior-point methods A full Nesterov-Todd step interior-point method for circular cone optimization [Volume 1, Issue 2, 2016, Pages 83-102]
  • Inverse problem On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance [Volume 4, Issue 1, 2019, Pages 35-46]
  • Italian domatic number The Italian domatic number of a digraph [Volume 4, Issue 1, 2019, Pages 61-70]
  • Italian dominating function The Italian domatic number of a digraph [Volume 4, Issue 1, 2019, Pages 61-70]
  • Italian domination number The Italian domatic number of a digraph [Volume 4, Issue 1, 2019, Pages 61-70]

K

  • Kernel function An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step [Volume 3, Issue 1, 2018, Pages 51-70]
  • Kirchhoff index On relation between the Kirchhoff index and number of spanning trees of graph [Volume 5, Issue 1, 2020, Pages 1-8]

L

  • Leap Zagreb index Leap Zagreb indices of trees and unicyclic graphs [Volume 3, Issue 2, 2018, Pages 179-194]
  • Linear complementarity problem An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step [Volume 3, Issue 1, 2018, Pages 51-70]

M

N

  • Net-regular signed graph On net-Laplacian Energy of Signed Graphs [Volume 2, Issue 1, 2017, Pages 11-19]
  • NP-completeness Complexity and approximation ratio of semitotal domination in graphs [Volume 3, Issue 2, 2018, Pages 143-150]

O

  • Oriented graph New skew equienergetic oriented graphs [Volume 4, Issue 1, 2019, Pages 15-24]

P

  • Paired-domination game Paired-Domination Game Played in Graphs [Volume 4, Issue 2, 2019, Pages 79-94]
  • Paired-domination number Paired-Domination Game Played in Graphs [Volume 4, Issue 2, 2019, Pages 79-94]
  • Peripheral Wiener Index Peripheral Wiener Index of a Graph [Volume 2, Issue 1, 2017, Pages 43-56]
  • Polynomial complexity An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step [Volume 3, Issue 1, 2018, Pages 51-70]

R

  • Randi'c index Relationships between Randic index and other topological indices [(Articles in Press)]
  • Roman ${2}$-domination A characterization of trees with equal Roman 2-domination and Roman domination numbers [Volume 4, Issue 2, 2019, Pages 95-107]
  • Roman domatic number The Roman domination and domatic numbers of a digraph [Volume 4, Issue 1, 2019, Pages 47-59]
  • Roman domatic number A note on the Roman domatic number of a digraph [Volume 5, Issue 1, 2020, Pages 19-26]
  • Roman dominating function Bounds on the restrained Roman domination number of a graph [Volume 1, Issue 1, 2016, Pages 75-82]
  • Roman dominating function The Roman domination and domatic numbers of a digraph [Volume 4, Issue 1, 2019, Pages 47-59]
  • Roman dominating function A note on the Roman domatic number of a digraph [Volume 5, Issue 1, 2020, Pages 19-26]
  • Roman domination A characterization of trees with equal Roman 2-domination and Roman domination numbers [Volume 4, Issue 2, 2019, Pages 95-107]
  • Roman domination On trees with equal Roman domination and outer-independent Roman domination numbers [Volume 4, Issue 2, 2019, Pages 185-199]
  • Roman domination Bounds on signed total double Roman domination [Volume 5, Issue 2, 2020, Pages 191-206]
  • Roman domination number Bounds on the restrained Roman domination number of a graph [Volume 1, Issue 1, 2016, Pages 75-82]
  • Roman domination number Roman domination excellent graphs: trees [Volume 3, Issue 1, 2018, Pages 1-24]
  • Roman domination number The Roman domination and domatic numbers of a digraph [Volume 4, Issue 1, 2019, Pages 47-59]
  • Roman domination number A note on the Roman domatic number of a digraph [Volume 5, Issue 1, 2020, Pages 19-26]

S

  • Second degree On leap Zagreb indices of graphs [Volume 2, Issue 2, 2017, Pages 99-117]
  • Secure sets Strong Alliances in Graphs [Volume 4, Issue 1, 2019, Pages 1-13]
  • Self-concordance Primal-dual path-following algorithms for circular programming [Volume 2, Issue 2, 2017, Pages 65-85]
  • Shortest Path Problem Approximation Solutions for Time-Varying Shortest Path Problem [Volume 2, Issue 2, 2017, Pages 139-147]
  • Signed graphs Characterization of signed paths and cycles admitting minus dominating function [Volume 5, Issue 1, 2020, Pages 61-68]
  • Signed Roman $k$-dominating function Weak signed Roman k-domination in graphs [(Articles in Press)]
  • Signed Roman $k$-domination number Weak signed Roman k-domination in graphs [(Articles in Press)]
  • Skew energy New skew equienergetic oriented graphs [Volume 4, Issue 1, 2019, Pages 15-24]
  • Skew equienergetic New skew equienergetic oriented graphs [Volume 4, Issue 1, 2019, Pages 15-24]
  • Split graph Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
  • Strong alliances Strong Alliances in Graphs [Volume 4, Issue 1, 2019, Pages 1-13]
  • Super domination number On the super domination number of graphs [Volume 5, Issue 2, 2020, Pages 83-96]
  • Super-edge-connected graphs Sufficient conditions for maximally edge-connected and super-edge-connected [Volume 2, Issue 1, 2017, Pages 35-41]

T

  • Time-Varying Optimization Approximation Solutions for Time-Varying Shortest Path Problem [Volume 2, Issue 2, 2017, Pages 139-147]
  • Topological indices On relation between the Kirchhoff index and number of spanning trees of graph [Volume 5, Issue 1, 2020, Pages 1-8]
  • Topological indices Some new bounds on the general sum--connectivity index [Volume 5, Issue 2, 2020, Pages 97-109]
  • Topological indices A note on the first Zagreb index and coindex of graphs [(Articles in Press)]
  • Topological ordering algorithm The topological ordering of covering nodes [Volume 5, Issue 1, 2020, Pages 55-60]
  • Transitivity New results on upper domatic number of graphs [Volume 5, Issue 2, 2020, Pages 125-137]

U

  • Upper domatic number New results on upper domatic number of graphs [Volume 5, Issue 2, 2020, Pages 125-137]
  • Upper domatic partition New results on upper domatic number of graphs [Volume 5, Issue 2, 2020, Pages 125-137]

W

Z

  • Zagreb index Leap Zagreb indices of trees and unicyclic graphs [Volume 3, Issue 2, 2018, Pages 179-194]
  • Zagreb indices On leap Zagreb indices of graphs [Volume 2, Issue 2, 2017, Pages 99-117]
  • Zagreb indices Relationships between Randic index and other topological indices [(Articles in Press)]
  • Zeroth-order general Randic index Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs [Volume 1, Issue 1, 2016, Pages 1-13]