2024
Graphs G Where G-N[v] is a Tree for Each Vertex v.
Graphs Comb., August, 2024
Graphs G where G-N[v] is a regular graph for each vertex v.
Comput. Appl. Math., July, 2024
The first general Zagreb index of graphs and their line graphs.
J. Appl. Math. Comput., June, 2024
Cycle Isolation of Graphs with Small Girth.
Graphs Comb., April, 2024
The k-Sombor Index of Trees.
Asia Pac. J. Oper. Res., February, 2024
On some conjectures on biclique graphs.
Discret. Appl. Math., January, 2024
Outer connected domination in maximal outerplanar graphs and beyond.
Discuss. Math. Graph Theory, 2024
On the cycle isolation number of triangle-free graphs.
Discret. Math., 2024
Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two.
Discret. Math., 2024
Discret. Appl. Math., 2024
2023
Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two.
Graphs Comb., October, 2023
On packing S-colorings of subcubic graphs.
Discret. Appl. Math., July, 2023
Conflict-Free Connection Number of Graphs with Four Bridges.
Graphs Comb., June, 2023
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs.
Discret. Appl. Math., 2023
Harmonic index of a line graph.
Discret. Appl. Math., 2023
On Several Parameters of Super Line Graph L2(G).
Axioms, 2023
Weak saturation number of a complete bipartite graph.
Appl. Math. Comput., 2023
Induced subgraphs of a tree with constraint degree.
Appl. Math. Comput., 2023
2022
On <i>r</i>-hued coloring of product graphs.
RAIRO Oper. Res., November, 2022
Domination number and feedback vertex number of complements of line graphs.
AKCE Int. J. Graphs Comb., September, 2022
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees.
J. Comb. Optim., 2022
Admissible Property of Graphs in Terms of Radius.
Graphs Comb., 2022
Broadcast Domination in Subcubic Graphs.
Graphs Comb., 2022
Injective Edge-Coloring of Graphs with Small Weight.
Graphs Comb., 2022
Arbitrarily partitionable 2K<sub>2</sub>, C<sub>4</sub>-free graphs.
Discuss. Math. Graph Theory, 2022
Graphs G in which G-N[v] has a prescribed property for each vertex v.
Discret. Appl. Math., 2022
Extremal graphs with respect to two distance-based topological indices.
Discret. Appl. Math., 2022
Disproofs of three conjectures on the power domination of graphs.
Discret. Appl. Math., 2022
The size of graphs with given feedback vertex number.
Discret. Appl. Math., 2022
Decomposition of graphs with constraint on minimum degree.
Discret. Appl. Math., 2022
Randić Index of a Line Graph.
Axioms, 2022
On S-packing edge-colorings of graphs with small edge weight.
Appl. Math. Comput., 2022
Proper-walk connection of hamiltonian digraphs.
Appl. Math. Comput., 2022
2021
Average Edge-Connectivity of Cubic Graphs.
J. Interconnect. Networks, 2021
Wiener Index of k-Connected Graphs.
J. Interconnect. Networks, 2021
Graphs in which <i>G</i> - <i>N</i>[<i>v</i>] is a cycle for each vertex <i>v</i>.
Discret. Math., 2021
K1, 2-isolation in graphs.
Discret. Appl. Math., 2021
Proof of a conjecture on the strong chromatic index of Halin graphs.
Discret. Appl. Math., 2021
Disproofs of two conjectures on no hole anti-n-labeling of graphs.
Discret. Appl. Math., 2021
Eigenvalues and triangles in graphs.
Comb. Probab. Comput., 2021
Graphs where each spanning tree has a perfect matching.
Contributions Discret. Math., 2021
Appl. Math. Comput., 2021
The k-independence number of t-connected graphs.
Appl. Math. Comput., 2021
2020
The κk-connectivity of line graphs.
Discret. Appl. Math., 2020
2019
On the geometric-arithmetic index of a graph.
Discret. Appl. Math., 2019
Feedback vertex number of Sierpiński-type graphs.
Contributions Discret. Math., 2019
2018
Edge-disjoint spanning trees and the number of maximum state circles of a graph.
J. Comb. Optim., 2018
Making a dominating set of a graph connected.
Discuss. Math. Graph Theory, 2018
Maximum value of conflict-free vertex-connection number of graphs.
Discret. Math. Algorithms Appl., 2018
Steiner tree packing number and tree connectivity.
Discret. Math., 2018
Strong edge chromatic index of the generalized Petersen graphs.
Appl. Math. Comput., 2018
Partitioning the Cartesian product of a tree and a cycle.
Appl. Math. Comput., 2018
2017
Paired-domination number of claw-free odd-regular graphs.
J. Comb. Optim., 2017
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree.
J. Comb. Optim., 2017
More bounds for the Grundy number of graphs.
J. Comb. Optim., 2017
Nordhaus-Gaddum type result for the matching number of a graph.
J. Comb. Optim., 2017
Upper bounds for the achromatic and coloring numbers of a graph.
Discret. Appl. Math., 2017
A -decomposition of tournaments and bipartite digraphs.
Discret. Appl. Math., 2017
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph.
Electron. J. Comb., 2017
2016
Maximum size of digraphs with some parameters.
J. Comb. Optim., 2016
2-Edge connected dominating sets and 2-Connected dominating sets of a graph.
J. Comb. Optim., 2016
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs.
Discret. Appl. Math., 2016
Proof of a conjecture on the zero forcing number of a graph.
Discret. Appl. Math., 2016
Remoteness and distance eigenvalues of a graph.
Discret. Appl. Math., 2016
2015
A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs.
Graphs Comb., 2015
Star decomposition of graphs.
Discret. Math. Algorithms Appl., 2015
The clique-transversal number of a {K<sub>1, 3</sub>, K<sub>4</sub>}-free 4-regular graph.
Discret. Math., 2015
Domination of maximal K<sub>4</sub>-minor free graphs and maximal K<sub>2, 3</sub>-minor free graphs, and disproofs of two conjectures on planar graphs.
Discret. Appl. Math., 2015
2014
The hub number, girth and Mycielski graphs.
Inf. Process. Lett., 2014
Disproof of the group coloring version of the Hadwiger conjecture.
Discret. Math. Algorithms Appl., 2014
Outer-connected domination in 2-connected cubic graphs.
Discret. Math. Algorithms Appl., 2014
[1, 2]-domination in graphs.
Discret. Appl. Math., 2014
Randić index and coloring number of a graph.
Discret. Appl. Math., 2014
Average distance, radius and remoteness of a graph.
Ars Math. Contemp., 2014
2013
Minimum degree, edge-connectivity and radius.
J. Comb. Optim., 2013
A Note on Semi-coloring of Graphs.
Graphs Comb., 2013
Hamiltonicity of transformation graph G<sup>+ - </sup>.
Ars Comb., 2013
2012
Proximity and average eccentricity of a graph.
Inf. Process. Lett., 2012
List Point Arboricity of Graphs.
Discret. Math. Algorithms Appl., 2012
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs.
Appl. Math. Lett., 2012
2011
The Hyper-Wiener Index of the kth Power of a Graph.
Discret. Math. Algorithms Appl., 2011
On the Sum of Independence Number and Average Degree of a Graph.
Discret. Math. Algorithms Appl., 2011
A Conjecture on Average Distance and Diameter of a Graph.
Discret. Math. Algorithms Appl., 2011
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts.
Discret. Math. Algorithms Appl., 2011
Proof of a conjecture on connectivity of Kronecker product of graphs.
Discret. Math., 2011
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts.
Discret. Appl. Math., 2011
On chromatic number of graphs without certain induced subgraphs.
Ars Comb., 2011
2010
HajóS-like Theorem for Group Coloring.
Discret. Math. Algorithms Appl., 2010
2009
List Point Arboricity of Dense Graphs.
Graphs Comb., 2009
Maximum values of Szeged index and edge-Szeged index of graphs.
Electron. Notes Discret. Math., 2009
List linear arboricity of planar graphs.
Discuss. Math. Graph Theory, 2009
On perfect matchings of complements of line graphs.
Ars Comb., 2009
The transformation graph G<sup>++-</sup>.
Australas. J Comb., 2009
A Note on Edge Choosability and Degeneracy of Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
Super-connected and hyper-connected jump graphs.
Int. J. Comput. Math., 2008
Transformation graph G<sup>-+-</sup>.
Discret. Math., 2008
The minimum number of vertices for a triangle-free graph with chi<sub>l</sub>(G)=4 is 11.
Discret. Math., 2008
Disproof of a Conjecture on List Coloring.
Ars Comb., 2008
The Wiener index of the kth power of a graph.
Appl. Math. Lett., 2008
2007
Hamiltonicity of complements of middle graphs.
Discret. Math., 2007
2006
A note on the cover degeneracy of graphs.
J. Graph Theory, 2006
Extension of a list coloring problem.
Appl. Math. Lett., 2006
2005
A note on 3-choosability of planar graphs without certain cycles.
Discret. Math., 2005
The transformation graph <i>G<sup>xyz</sup></i> when <i>xyz</i>=-++.
Discret. Math., 2005
Hamiltonicity of Complements of Total Graphs.
Proceedings of the Discrete Geometry, 2005
2004
Edge choosability of planar graphs without small cycles.
Discret. Math., 2004
