2025
The saturation number of C6.
Discret. Math., 2025
2024
Planar Turán Numbers of Cubic Graphs and Disjoint Union of Cycles.
Graphs Comb., April, 2024
The saturation number of <i>K</i><sub>3,3</sub>.
Discret. Math., March, 2024
A note on rainbow-free colorings of uniform hypergraphs.
Discret. Appl. Math., February, 2024
Counting rainbow triangles in edge-colored graphs.
J. Graph Theory, 2024
Extremal spectral results of planar graphs without vertex-disjoint cycles.
J. Graph Theory, 2024
Homomorphisms to small negative even cycles.
Eur. J. Comb., 2024
Nowhere-Zero 3-Flows in Signed Planar Graphs.
Electron. J. Comb., 2024
2023
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3.
Discret. Appl. Math., October, 2023
The Extended Dominating Sets in Graphs.
Asia Pac. J. Oper. Res., October, 2023
On critical graphs for the chromatic edge-stability number.
Discret. Math., May, 2023
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs.
J. Comb. Optim., 2023
A sharp lower bound for the spectral radius in <i>K</i><sub>4</sub>-saturated graphs.
Discret. Math., 2023
Approximate Nash Equilibria Algorithms for Shapley Network Design Games.
CoRR, 2023
2022
Smallest number of vertices in a 2-arc-strong digraph without good pairs.
Theor. Comput. Sci., 2022
Star Chromatic Index of 1-Planar Graphs.
Symmetry, 2022
Integer linear programming formulations for double roman domination problem.
Optim. Methods Softw., 2022
Graph Classes with Locally Irregular Chromatic Index at most 4.
J. Optim. Theory Appl., 2022
ℓ $\ell $ -Connectivity and ℓ $\ell $ -edge-connectivity of random graphs.
J. Graph Theory, 2022
Nowhere-zero 3-flows in toroidal graphs.
J. Comb. Theory B, 2022
On 3-flow-critical graphs.
Eur. J. Comb., 2022
On k-uniform random hypergraphs without generalized fans.
Discret. Appl. Math., 2022
Maximisers of the hypergraph Lagrangian outside the principal range.
Appl. Math. Comput., 2022
2021
<i>k</i>-Critical graphs in <i>P</i><sub>5</sub>-free graphs.
Theor. Comput. Sci., 2021
Integer Flows and Modulo Orientations of Signed Graphs.
SIAM J. Discret. Math., 2021
The maximum number of maximum dissociation sets in trees.
J. Graph Theory, 2021
Mixed connectivity properties of random graphs and some special graphs.
J. Comb. Optim., 2021
Sharp Upper Bounds on the k-Independence Number in Graphs with Given Minimum and Maximum Degree.
Graphs Comb., 2021
Acyclic Edge Coloring of Chordal Graphs with Bounded Degree.
Graphs Comb., 2021
Exact rainbow numbers for matchings in plane triangulations.
Discret. Math., 2021
On list 3-dynamic coloring of near-triangulations.
Discret. Appl. Math., 2021
Gallai-Ramsey numbers of C<sub>10</sub> and C<sub>12</sub>.
Australas. J Comb., 2021
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings.
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs.
SIAM J. Discret. Math., 2020
Gallai-Ramsey number for K 4.
J. Graph Theory, 2020
Proper orientation number of triangle-free bridgeless outerplanar graphs.
J. Graph Theory, 2020
The edit distance function of some graphs.
Discuss. Math. Graph Theory, 2020
The annihilation number does not bound the 2-domination number from the above.
Discret. Math., 2020
k-Ary spanning trees contained in tournaments.
Discret. Appl. Math., 2020
Boolean Networks and Their Applications in Science and Engineering.
Complex., 2020
The Orbit-Polynomial: A Novel Measure of Symmetry in Networks.
IEEE Access, 2020
k-Critical Graphs in P<sub>5</sub>-Free Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
2019
A new coupled disease-awareness spreading model with mass media on multiplex networks.
Inf. Sci., 2019
On the degeneracy of the Randić entropy and related graph measures.
Inf. Sci., 2019
Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach.
Inf. Sci., 2019
Planar Turán Numbers of Short Paths.
Graphs Comb., 2019
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth.
Discret. Math. Theor. Comput. Sci., 2019
An efficient polynomial time approximation scheme for the vertex cover <i>P<sub> </sub>3</i> problem on planar graphs.
Discuss. Math. Graph Theory, 2019
The Turán number of <i>2P<sub>7</sub></i>.
Discuss. Math. Graph Theory, 2019
Improved bounds for rainbow numbers of matchings in plane triangulations.
Discret. Math., 2019
Extremal Theta-free planar graphs.
Discret. Math., 2019
Planar anti-Ramsey numbers of paths and cycles.
Discret. Math., 2019
Degree powers in graphs with a forbidden forest.
Discret. Math., 2019
On the complexity of k-rainbow cycle colouring problems.
Discret. Appl. Math., 2019
Extremal problems on saturation for the family of k-edge-connected graphs.
Discret. Appl. Math., 2019
Critical (P6, banner)-free graphs.
Discret. Appl. Math., 2019
New inequalities for network distance measures by using graph spectra.
Discret. Appl. Math., 2019
Sum of weighted distances in trees.
Discret. Appl. Math., 2019
Extremal H-Free Planar Graphs.
Electron. J. Comb., 2019
Extremal values of energy over oriented bicyclic graphs.
Appl. Math. Comput., 2019
Nordhaus-Gaddum type results for graph irregularities.
Appl. Math. Comput., 2019
The Turán number of star forests.
Appl. Math. Comput., 2019
On efficient network similarity measures.
Appl. Math. Comput., 2019
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019
2018
Star chromatic index of subcubic multigraphs.
J. Graph Theory, 2018
Rainbow vertex connection of digraphs.
J. Comb. Optim., 2018
Graph measures with high discrimination power revisited: A random polynomial approach.
Inf. Sci., 2018
Spectrum bounds for the scattering number, integrity, tenacity of regular graphs.
Future Gener. Comput. Syst., 2018
Measurements and security of complex networks and systems: Research advances and challenges.
Future Gener. Comput. Syst., 2018
Star 5-edge-colorings of subcubic multigraphs.
Discret. Math., 2018
On the generalized Wiener polarity index of trees with a given diameter.
Discret. Appl. Math., 2018
Sharp bounds for the Randić index of graphs with given minimum and maximum degree.
Discret. Appl. Math., 2018
Total rainbow connection of digraphs.
Discret. Appl. Math., 2018
Vertex-based and edge-based centroids of graphs.
Appl. Math. Comput., 2018
Non-jumping numbers for 5-uniform hypergraphs.
Appl. Math. Comput., 2018
On the [1, 2]-domination number of generalized Petersen graphs.
Appl. Math. Comput., 2018
2017
Coupon coloring of some special graphs.
J. Comb. Optim., 2017
On minimally 2-connected graphs with generalized connectivity κ<sub>3</sub> = 2.
J. Comb. Optim., 2017
A comparative analysis of new graph distance measures and graph edit distance.
Inf. Sci., 2017
Quantitative Graph Theory: A new branch of graph theory and network science.
Inf. Sci., 2017
Highly unique network descriptors based on the roots of the permanental polynomial.
Inf. Sci., 2017
A Support Vector Machine for Regression in Complex Field.
Informatica, 2017
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles.
Graphs Comb., 2017
Toward Measuring Network Aesthetics Based on Symmetry.
Axioms, 2017
Mixed Connectivity of Random Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Some Motzkin-Straus type results for non-uniform hypergraphs.
J. Comb. Optim., 2016
Fifty years of graph matching, network alignment and network comparison.
Inf. Sci., 2016
An improved algorithm for the vertex cover P<sub>3</sub> problem on graphs of bounded treewidth.
CoRR, 2016
A method for inferring inequalities for probability values applied to complex networks.
Complex., 2016
A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration.
Appl. Math. Comput., 2016
2015
Entropy of Weighted Graphs with Randi'c Weights.
Entropy, 2015
Polynomial reconstruction of the matching polynomial.
Electron. J. Graph Theory Appl., 2015
The complexity of determining the vertex-rainbow index of graphs.
Discret. Math. Algorithms Appl., 2015
Connections between generalized graph entropies and graph energy.
Complex., 2015
Matching energy of unicyclic and bicyclic graphs with a given diameter.
Complex., 2015
Note on a Turan-type problem on distances.
Ars Comb., 2015
Note on two generalizations of the Randić index.
Appl. Math. Comput., 2015
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs.
Appl. Math. Comput., 2015
Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial.
Appl. Math. Comput., 2015
Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix.
Appl. Math. Comput., 2015
Graph distance measures based on topological indices revisited.
Appl. Math. Comput., 2015
Bounds for degree-based network entropies.
Appl. Math. Comput., 2015
2014
Extremality of degree-based graph entropies.
Inf. Sci., 2014
A Note on Distance-based Graph Entropies.
Entropy, 2014
The Wiener Polarity Index of Graph Products.
Ars Comb., 2014
Rainbow connections for outerplanar graphs with diameter 2 and 3.
Appl. Math. Comput., 2014
Entropy bounds for dendrimers.
Appl. Math. Comput., 2014
2013
Rainbow Connections of Graphs: A Survey.
Graphs Comb., 2013
Rainbow Connection in 3-Connected Graphs.
Graphs Comb., 2013
On the rainbow vertex-connection.
Discuss. Math. Graph Theory, 2013
2011
The complexity of determining the rainbow vertex-connection of a graph.
Theor. Comput. Sci., 2011
Complete solution to a conjecture on the maximal energy of unicyclic graphs.
Eur. J. Comb., 2011
Rainbow connections for planar graphs and line graphs
CoRR, 2011
The complexity of determining the rainbow vertex-connection of graphs
CoRR, 2011
On the diameter and inverse degree.
Ars Comb., 2011
The minimal size of a graph with generalized connectivity κ<sub>3</sub> = 2.
Australas. J Comb., 2011
2010
On a relation between the Randic index and the chromatic number.
Discret. Math., 2010
2007
Corrections of proofs for Hansen and Mélot's two theorems.
Discret. Appl. Math., 2007
Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index.
Discret. Appl. Math., 2007
