A
-
ABC index
Relationships between Randic index and other topological indices [Volume 6, Issue 1, 2021, Pages 137-154]
-
Adjacency matrix
Two upper bounds on the A_α-spectral radius of a connected graph [Volume 7, Issue 1, 2022, Pages 53-57]
-
Algebraic Graph Theory
A survey on the Intersection graphs of ideals of rings [Volume 7, Issue 2, 2022, Pages 121-167]
-
Algorithm
Efficient algorithms for independent Roman domination on some classes of graphs [(Articles in Press)]
-
Algorithm
Double Roman domination in graphs: algorithmic complexity [(Articles in Press)]
-
Algorithm
Linear-time construction of floor plans for plane triangulations [(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]
-
Antimagic labeling
The Cartesian product of wheel graph and path graph is antimagic [(Articles in Press)]
-
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]
-
APX-complete
Algorithmic aspects of total Roman ${2}$-domination in graphs [Volume 7, Issue 2, 2022, Pages 183-192]
-
Artinian ring
A survey on the Intersection graphs of ideals of rings [Volume 7, Issue 2, 2022, Pages 121-167]
-
Augmented Zagreb index
Relationships between Randic index and other topological indices [Volume 6, Issue 1, 2021, Pages 137-154]
B
-
Bell number
Stirling number of the fourth kind and lucky partitions of a finite set [Volume 6, Issue 2, 2021, Pages 211-219]
-
Bicyclic Graph
Signed bicyclic graphs with minimal index [(Articles in Press)]
-
Bipartite graph
Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
-
Bipartite Kneser type-1 graphs
2S3 transformation for Dyadic fractions in the interval (0, 1) [(Articles in Press)]
-
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]
-
Centrality measure
The stress of a graph [(Articles in Press)]
-
Certified domination
Algorithmic aspects of certified domination in graphs [Volume 7, Issue 2, 2022, Pages 247-255]
-
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]
-
Commutative rings
On Randić spectrum of zero divisor graphs of commutative ring $mathbb{Z}_{n} $ [(Articles in Press)]
-
Complemented graph
Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
-
Cops and Robbers
Cop-edge critical generalized Petersen and Paley graphs [(Articles in Press)]
-
Corona product
On the super domination number of graphs [Volume 5, Issue 2, 2020, Pages 83-96]
-
Covering
Covering total double Roman domination in graphs [(Articles in Press)]
-
Covering nodes
The topological ordering of covering nodes [Volume 5, Issue 1, 2020, Pages 55-60]
D
-
Data envelopment analysis
Further study on "an extended shortest path problem A data envelopment analysis approach" [(Articles in Press)]
-
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]
-
Different-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 [Volume 6, Issue 1, 2021, Pages 17-26]
-
Distance-$k$ domination
k-Efficient partitions of graphs [Volume 4, Issue 2, 2019, Pages 109-122]
-
Distance compatibility
On the powers of signed graphs [Volume 7, Issue 1, 2022, Pages 45-51]
-
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]
-
Distinct edge geodetic decomposition
Distinct edge geodetic decomposition in graphs [Volume 6, Issue 2, 2021, Pages 185-196]
-
Distinct edge geodetic decomposition number
Distinct edge geodetic decomposition in graphs [Volume 6, Issue 2, 2021, Pages 185-196]
-
Domatic number
The upper domatic number of powers of graphs [Volume 6, Issue 1, 2021, Pages 53-65]
-
Domatic number
Regular graphs with large Italian domatic number [Volume 7, Issue 2, 2022, Pages 257-271]
-
Dominating functions
Roman domination in signed graphs [(Articles in Press)]
-
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]
-
Domination number
Total domination in cubic Knödel graphs [Volume 6, Issue 2, 2021, Pages 221-230]
-
Domination number
Total outer-convex domination number of graphs [Volume 7, Issue 1, 2022, Pages 59-68]
-
Domination number
Algorithmic Aspects of Quasi-Total Roman Domination in Graphs [Volume 7, Issue 1, 2022, Pages 93-104]
-
Domination number
Outer-independent total 2-rainbow dominating functions in graphs [(Articles in Press)]
-
Double Italian domination
Restrained double Italian domination in graphs [(Articles in Press)]
-
Double Roman domatic number
Double Roman domination and domatic numbers of graphs [Volume 3, Issue 1, 2018, Pages 71-77]
-
Double Roman dominating function
Double Roman domination in graphs: algorithmic complexity [(Articles in Press)]
-
Double Roman domination number
Double Roman domination and domatic numbers of graphs [Volume 3, Issue 1, 2018, Pages 71-77]
-
Dyadic 2S3 transformation function
2S3 transformation for Dyadic fractions in the interval (0, 1) [(Articles in Press)]
-
Dyadic fractions
2S3 transformation for Dyadic fractions in the interval (0, 1) [(Articles in Press)]
-
Dynamic programming
Double Roman domination in graphs: algorithmic complexity [(Articles in Press)]
E
-
Eccentricity
Eccentric completion of a graph [Volume 7, Issue 2, 2022, Pages 193-201]
-
Edge geodetic number
Distinct edge geodetic decomposition in graphs [Volume 6, Issue 2, 2021, Pages 185-196]
-
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]
-
Eigenvalue of graph
New bounds on the energy of a graph [Volume 7, Issue 1, 2022, Pages 81-90]
-
Element splitting
The Tutte polynomial of matroids constructed by a family of splitting operations [Volume 7, Issue 1, 2022, Pages 69-79]
-
Energy
New bounds on the energy of a graph [Volume 7, Issue 1, 2022, Pages 81-90]
-
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]
-
Exact 1-step dominating set
Strength of strongest dominating sets in fuzzy graphs [Volume 6, Issue 2, 2021, Pages 287-297]
-
Extremal Graph Theory
Signed bicyclic graphs with minimal index [(Articles in Press)]
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]
-
Fuzzy Graphs
Bounds for fuzzy Zagreb Estrada index [(Articles in Press)]
-
Fuzzy Zagreb Energies
Bounds for fuzzy Zagreb Estrada index [(Articles in Press)]
-
Fuzzy Zagreb Estrada Index
Bounds for fuzzy Zagreb Estrada index [(Articles in Press)]
-
Fuzzy Zagreb indices
Bounds for fuzzy Zagreb Estrada index [(Articles in Press)]
-
Fuzzy Zagreb Matrices
Bounds for fuzzy Zagreb Estrada index [(Articles in Press)]
G
-
Gallai-mortal graph
A survey of the studies on Gallai and anti-Gallai graphs [Volume 6, Issue 1, 2021, Pages 93-112]
-
Geometric-Arithmetic index
Relationships between Randic index and other topological indices [Volume 6, Issue 1, 2021, Pages 137-154]
-
Graph energy
Þ-energy of generalized Petersen graphs [Volume 7, Issue 1, 2022, Pages 1-16]
-
Graphs products
On the total liar's domination of graphs [Volume 7, Issue 2, 2022, Pages 169-175]
-
Graph topology
A study on graph topology [(Articles in Press)]
-
Graph Transformation
On trees and the multiplicative sum Zagreb index [Volume 1, Issue 2, 2016, Pages 137-148]
-
Graph Transformation
Sombor index of some graph transformations [(Articles in Press)]
-
Grid graph
Line completion number of grid graph Pn × Pm [Volume 6, Issue 2, 2021, Pages 299-313]
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
-
Improper colouring
A note on δ^(k)-colouring of the Cartesian product of some graphs [Volume 7, Issue 1, 2022, Pages 113-120]
-
Independent rainbow domination
A new upper bound on the independent $2$-rainbow domination number in trees [(Articles in Press)]
-
Independent Roman dominating function
Efficient algorithms for independent Roman domination on some classes of graphs [(Articles in Press)]
-
Index
Signed bicyclic graphs with minimal index [(Articles in Press)]
-
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]
-
Integer linear programming
Vertex-Edge Roman Domination in Graphs: Complexity and Algorithms [(Articles in Press)]
-
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]
-
Irregularity
On the extremal total irregularity index of n-vertex trees with fixed maximum degree [Volume 6, Issue 1, 2021, Pages 113-121]
-
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
Regular graphs with large Italian domatic number [Volume 7, Issue 2, 2022, Pages 257-271]
-
Italian domination
Remarks on the restrained Italian domination number in graphs [(Articles in Press)]
-
Italian domination number
The Italian domatic number of a digraph [Volume 4, Issue 1, 2019, Pages 61-70]
J
-
Join of graphs
On the total liar's domination of graphs [Volume 7, Issue 2, 2022, Pages 169-175]
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]
-
Kirchhoff index
Improved bounds for Kirchhoff index of graphs [(Articles in Press)]
-
Knodel graph
Total domination in cubic Knödel graphs [Volume 6, Issue 2, 2021, Pages 221-230]
L
-
Laplacian eigenvalues (of graph)
Improved bounds for Kirchhoff index of graphs [(Articles in Press)]
-
Laplacian matrix
Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs [Volume 6, Issue 2, 2021, Pages 259-271]
-
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]
-
Linear optimization
A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function [Volume 7, Issue 1, 2022, Pages 29-44]
-
Line completion number
Line completion number of grid graph Pn × Pm [Volume 6, Issue 2, 2021, Pages 299-313]
-
Line graph
A survey of the studies on Gallai and anti-Gallai graphs [Volume 6, Issue 1, 2021, Pages 93-112]
-
Line graph
Line completion number of grid graph Pn × Pm [Volume 6, Issue 2, 2021, Pages 299-313]
-
Lucky partition
Stirling number of the fourth kind and lucky partitions of a finite set [Volume 6, Issue 2, 2021, Pages 211-219]
M
-
Magic labeling
The Cartesian product of wheel graph and path graph is antimagic [(Articles in Press)]
-
Maximally edge-connected digraphs
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs [Volume 1, Issue 1, 2016, Pages 1-13]
-
Maximally edge-connected graphs
Sufficient conditions for maximally edge-connected and super-edge-connected [Volume 2, Issue 1, 2017, Pages 35-41]
-
Maximum values
Unicyclic graphs with maximum Randić indices [(Articles in Press)]
-
Minus Dominating Function
Characterization of signed paths and cycles admitting minus dominating function [Volume 5, Issue 1, 2020, Pages 61-68]
-
Minus domination
Characterization of signed paths and cycles admitting minus dominating function [Volume 5, Issue 1, 2020, Pages 61-68]
-
Mixed Roman dominating function
Mixed Roman domination and 2-independence in trees [Volume 3, Issue 1, 2018, Pages 79-91]
-
Molecular descriptor
On the variable sum exdeg index and cut edges of graphs [Volume 6, Issue 2, 2021, Pages 249-257]
-
Multi attributes
Further study on "an extended shortest path problem A data envelopment analysis approach" [(Articles in Press)]
-
Multiplicative Sum Zagreb Index
On trees and the multiplicative sum Zagreb index [Volume 1, Issue 2, 2016, Pages 137-148]
N
-
Net-regular signed graph
On net-Laplacian Energy of Signed Graphs [Volume 2, Issue 1, 2017, Pages 11-19]
-
Nordhaus-Gaddum
Regular graphs with large Italian domatic number [Volume 7, Issue 2, 2022, Pages 257-271]
-
Nordhaus-Gaddum type bound
Strength of strongest dominating sets in fuzzy graphs [Volume 6, Issue 2, 2021, Pages 287-297]
-
Normalized distance Laplacian matrix
Normalized distance Laplacian matrices for signed graphs [(Articles in Press)]
-
Normalized distance Laplacian spectrum
Normalized distance Laplacian matrices for signed graphs [(Articles in Press)]
-
NP-complete
Algorithmic aspects of certified domination in graphs [Volume 7, Issue 2, 2022, Pages 247-255]
-
NP-complete
Vertex-Edge Roman Domination in Graphs: Complexity and Algorithms [(Articles in Press)]
-
NP-completeness
Complexity and approximation ratio of semitotal domination in graphs [Volume 3, Issue 2, 2018, Pages 143-150]
P
-
Paired dominating set
Complexity of the paired domination subdivision problem [Volume 7, Issue 2, 2022, Pages 177-182]
-
Paired-domination game
Paired-Domination Game Played in Graphs [Volume 4, Issue 2, 2019, Pages 79-94]
-
Paired domination number
Complexity of the paired domination subdivision problem [Volume 7, Issue 2, 2022, Pages 177-182]
-
Paired-domination number
Paired-Domination Game Played in Graphs [Volume 4, Issue 2, 2019, Pages 79-94]
-
Paired domination subdivision number
Complexity of the paired domination subdivision problem [Volume 7, Issue 2, 2022, Pages 177-182]
-
Paley graphs
Cop-edge critical generalized Petersen and Paley graphs [(Articles in Press)]
-
Pareto efficiency
Pareto-efficient strategies in 3-person games played with staircase-function strategies [(Articles in Press)]
-
Peripheral Wiener Index
Peripheral Wiener Index of a Graph [Volume 2, Issue 1, 2017, Pages 43-56]
-
Petersen graphs
Cop-edge critical generalized Petersen and Paley graphs [(Articles in Press)]
-
Pigeonhole Principle
Total domination in cubic Knödel graphs [Volume 6, Issue 2, 2021, Pages 221-230]
-
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]
-
Polynomial complexity
A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function [Volume 7, Issue 1, 2022, Pages 29-44]
-
Power of signed graphs
On the powers of signed graphs [Volume 7, Issue 1, 2022, Pages 45-51]
-
Product of signed graphs
On the distance spectra of product of signed graphs [(Articles in Press)]
-
Proper interval graph
Efficient algorithms for independent Roman domination on some classes of graphs [(Articles in Press)]
R
-
Rainbow domination
A new upper bound on the independent $2$-rainbow domination number in trees [(Articles in Press)]
-
Randi' {c} index
Unicyclic graphs with maximum Randić indices [(Articles in Press)]
-
Randi'c index
Relationships between Randic index and other topological indices [Volume 6, Issue 1, 2021, Pages 137-154]
-
Randi'c index, general sum-connectivity index
A note on polyomino chains with extremum general sum-connectivity index [Volume 6, Issue 1, 2021, Pages 81-91]
-
Randić matrix
On Randić spectrum of zero divisor graphs of commutative ring $mathbb{Z}_{n} $ [(Articles in Press)]
-
Randić spectrum
On Randić spectrum of zero divisor graphs of commutative ring $mathbb{Z}_{n} $ [(Articles in Press)]
-
Ring
A survey on the Intersection graphs of ideals of rings [Volume 7, Issue 2, 2022, Pages 121-167]
-
Roman ${2}$-dominating function
Algorithmic aspects of total Roman ${2}$-domination in graphs [Volume 7, Issue 2, 2022, Pages 183-192]
-
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 dominating functions
Roman domination in signed graphs [(Articles in Press)]
-
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
Bounds on the outer-independent double Italian domination number [Volume 6, Issue 1, 2021, Pages 123-136]
-
Roman domination
A counterexample to a conjecture of Jafari Rad and Volkmann [Volume 7, Issue 1, 2022, Pages 91-92]
-
Roman domination
A note on Roman $k$-tuple domination number [Volume 7, Issue 2, 2022, Pages 273-274]
-
Roman domination
Covering total double Roman domination in graphs [(Articles in Press)]
-
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]
-
Roman domination number
On the Zagreb indices of graphs with given Roman domination number [(Articles in Press)]
-
Roman domination number
A lower bound for the second Zagreb index of trees with given Roman domination number [(Articles in Press)]
-
Roman k-tuple
A note on Roman $k$-tuple domination number [Volume 7, Issue 2, 2022, Pages 273-274]
S
-
Second degree
On leap Zagreb indices of graphs [Volume 2, Issue 2, 2017, Pages 99-117]
-
Second Zagreb index
A lower bound for the second Zagreb index of trees with given Roman domination number [(Articles in Press)]
-
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
Further study on "an extended shortest path problem A data envelopment analysis approach" [(Articles in Press)]
-
Shortest Path Problem
Approximation Solutions for Time-Varying Shortest Path Problem [Volume 2, Issue 2, 2017, Pages 139-147]
-
Signed distance
On the powers of signed graphs [Volume 7, Issue 1, 2022, Pages 45-51]
-
Signed distance matrix
On the distance spectra of product of signed graphs [(Articles in Press)]
-
Signed distance spectrum
On the distance spectra of product of signed graphs [(Articles in Press)]
-
Signed graph
On the powers of signed graphs [Volume 7, Issue 1, 2022, Pages 45-51]
-
Signed graph
On the distance spectra of product of signed graphs [(Articles in Press)]
-
Signed graph
Signed bicyclic graphs with minimal index [(Articles in Press)]
-
Signed graph
Line signed graph of a signed unit graph of commutative rings [(Articles in Press)]
-
Signed graphs
Characterization of signed paths and cycles admitting minus dominating function [Volume 5, Issue 1, 2020, Pages 61-68]
-
Signed graphs
Normalized distance Laplacian matrices for signed graphs [(Articles in Press)]
-
Signed Roman $k$-dominating function
Weak signed Roman $k$-domination in graphs [Volume 6, Issue 1, 2021, Pages 1-15]
-
Signed Roman $k$-domination number
Weak signed Roman $k$-domination in graphs [Volume 6, Issue 1, 2021, Pages 1-15]
-
Signed total Italian domination number
Signed total Italian domination in digraphs [(Articles in Press)]
-
Signed total Italian k-domatic number
Signed total Italian k-domatic number of a graph [(Articles in Press)]
-
Signed total Italian k-dominating function
Signed total Italian k-domination in graphs [Volume 6, Issue 2, 2021, Pages 171-183]
-
Signed total Italian k-dominating function
Signed total Italian k-domatic number of a graph [(Articles in Press)]
-
Signed total Italian k-domination number
Signed total Italian k-domination in graphs [Volume 6, Issue 2, 2021, Pages 171-183]
-
Signed total Italian k-domination number
Signed total Italian k-domatic number of a graph [(Articles in Press)]
-
Signed total Roman k-dominating function
Signed total Italian k-domination in graphs [Volume 6, Issue 2, 2021, Pages 171-183]
-
Signed total Roman k-domination number
Signed total Italian k-domination in graphs [Volume 6, Issue 2, 2021, Pages 171-183]
-
Signless Laplacian matrix
Signless Laplacian eigenvalues of the zero divisor graph associated to finite commutative ring $ mathbb{Z}_{p^{M_{1}}~q^{M_{2}}} $ [(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]
-
SM sum graphs
2S3 transformation for Dyadic fractions in the interval (0, 1) [(Articles in Press)]
-
Sombor coindex
On Sombor coindex of graphs [(Articles in Press)]
-
Sombor index
Sombor index of some graph transformations [(Articles in Press)]
-
Sombor index
New bounds on Sombor index [(Articles in Press)]
-
Sombor index
On Sombor coindex of graphs [(Articles in Press)]
-
Split graph
Some results on a supergraph of the comaximal ideal graph of a commutative ring [Volume 3, Issue 2, 2018, Pages 151-172]
-
Splitting
The Tutte polynomial of matroids constructed by a family of splitting operations [Volume 7, Issue 1, 2022, Pages 69-79]
-
Splitting off
The Tutte polynomial of matroids constructed by a family of splitting operations [Volume 7, Issue 1, 2022, Pages 69-79]
-
Star decomposition
Distinct edge geodetic decomposition in graphs [Volume 6, Issue 2, 2021, Pages 185-196]
-
Stirling number of the fourth kind
Stirling number of the fourth kind and lucky partitions of a finite set [Volume 6, Issue 2, 2021, Pages 211-219]
-
Stirling number of the second kind
Stirling number of the fourth kind and lucky partitions of a finite set [Volume 6, Issue 2, 2021, Pages 211-219]
-
Strong alliances
Strong Alliances in Graphs [Volume 4, Issue 1, 2019, Pages 1-13]
-
Strongest dominating set in fuzzy graphs
Strength of strongest dominating sets in fuzzy graphs [Volume 6, Issue 2, 2021, Pages 287-297]
-
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]
-
Super line graph
Line completion number of grid graph Pn × Pm [Volume 6, Issue 2, 2021, Pages 299-313]
T
-
Terminal status of a vertex
Terminal status of vertices and terminal status connectivity indices of graphs with its applications to properties of cycloalkanes [Volume 7, Issue 2, 2022, Pages 275-300]
-
The Forgotten Zagreb Index
Inverse problem for the Forgotten and the hyper Zagreb indices of trees [Volume 7, Issue 2, 2022, Pages 203-209]
-
The hyper Zagreb Index
Inverse problem for the Forgotten and the hyper Zagreb indices of trees [Volume 7, Issue 2, 2022, Pages 203-209]
-
The number of closed walks
New bounds on the energy of a graph [Volume 7, Issue 1, 2022, Pages 81-90]
-
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 [Volume 6, Issue 1, 2021, Pages 41-51]
-
Topological indices
Improved bounds for Kirchhoff index of graphs [(Articles in Press)]
-
Topological ordering algorithm
The topological ordering of covering nodes [Volume 5, Issue 1, 2020, Pages 55-60]
-
Total liar' s domination
On the total liar's domination of graphs [Volume 7, Issue 2, 2022, Pages 169-175]
-
Total restrained domination
Total restrained Roman domination [(Articles in Press)]
-
Total Roman ${2}$-domination
Algorithmic aspects of total Roman ${2}$-domination in graphs [Volume 7, Issue 2, 2022, Pages 183-192]
-
Total Roman dominating function
A note on Roman $k$-tuple domination number [Volume 7, Issue 2, 2022, Pages 273-274]
-
Transitivity
New results on upper domatic number of graphs [Volume 5, Issue 2, 2020, Pages 125-137]
-
Tree-convex bipartite graphs
Algorithmic aspects of certified domination in graphs [Volume 7, Issue 2, 2022, Pages 247-255]
-
Triple Roman dominating function
An upper bound on triple Roman domination [(Articles in Press)]
-
Triple Roman domination number, Trees
An upper bound on triple Roman domination [(Articles in Press)]
-
Tutte polynomial
The Tutte polynomial of matroids constructed by a family of splitting operations [Volume 7, Issue 1, 2022, Pages 69-79]
U
-
Unicyclic graph
Efficient algorithms for independent Roman domination on some classes of graphs [(Articles in Press)]
-
Unicyclic graphs
Unicyclic graphs with maximum Randić indices [(Articles in Press)]
-
Unit Zq-MacDonald code
Unit $mathbb{Z}_q$-Simplex codes of type α and zero divisor $mathbb{Z}_q$-Simplex codes [(Articles in Press)]
-
Unit Zq-Simplex codes of type α
Unit $mathbb{Z}_q$-Simplex codes of type α and zero divisor $mathbb{Z}_q$-Simplex codes [(Articles in Press)]
-
Upper domatic number
New results on upper domatic number of graphs [Volume 5, Issue 2, 2020, Pages 125-137]
-
Upper domatic number
The upper domatic number of powers of graphs [Volume 6, Issue 1, 2021, Pages 53-65]
-
Upper domatic partition
New results on upper domatic number of graphs [Volume 5, Issue 2, 2020, Pages 125-137]
-
Upper domatic partition
The upper domatic number of powers of graphs [Volume 6, Issue 1, 2021, Pages 53-65]
V
-
Vertex cover
Vertex-Edge Roman Domination in Graphs: Complexity and Algorithms [(Articles in Press)]
-
Vertex-edge Roman-domination
Vertex-Edge Roman Domination in Graphs: Complexity and Algorithms [(Articles in Press)]
W
-
Weak signed Roman $k$-dominating function
Weak signed Roman $k$-domination in graphs [Volume 6, Issue 1, 2021, Pages 1-15]
-
Weighted digraph
More on the bounds for the skew Laplacian energy of weighted digraphs [(Articles in Press)]
-
Weighted Hermite--Hadamard inequality
A generalized form of the Hermite-Hadamard-Fejer type inequalities involving fractional integral for co-ordinated convex functions [Volume 6, Issue 1, 2021, Pages 27-40]
-
Weighted signed graphs
Normalized distance Laplacian matrices for signed graphs [(Articles in Press)]
-
Wiener Index
Peripheral Wiener Index of a Graph [Volume 2, Issue 1, 2017, Pages 43-56]
-
Wiener Index
Entire Wiener index of graphs [Volume 7, Issue 2, 2022, Pages 227-245]
Z
-
Zagreb energy
On Zagreb Energy and edge-Zagreb energy [Volume 6, Issue 1, 2021, Pages 155-169]
-
Zagreb index
Leap Zagreb indices of trees and unicyclic graphs [Volume 3, Issue 2, 2018, Pages 179-194]
-
Zagreb index
On the Zagreb indices of graphs with given Roman domination number [(Articles in Press)]
-
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 [Volume 6, Issue 1, 2021, Pages 137-154]
-
Zero divisor Zq-Simplex code and Weight distribution
Unit $mathbb{Z}_q$-Simplex codes of type α and zero divisor $mathbb{Z}_q$-Simplex codes [(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]
Your query does not match with any item