| Publication | Date of Publication | Type |
|---|
An upper bound on the two-distance domination number of a \(C_4\)-free graph
Advances in Mathematics (Beijing) | 2024-07-29 | Paper |
Total dominator colorings of \(P_4\)-reducible and \(P_4\)-tidy graphs.
Ars Combinatoria | 2024-06-05 | Paper |
The extended dominating sets in graphs
Asia-Pacific Journal of Operational Research | 2024-05-23 | Paper |
3-component domination numbers in graphs
Discrete Mathematics | 2024-02-19 | Paper |
The restrained double Roman domination in graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2023-02-03 | Paper |
The effect of vertex and edge deletion on the edge metric dimension of graphs
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
On the edge metric dimension of graphs
AIMS Mathematics | 2022-04-25 | Paper |
Polychromatic colorings of hypergraphs with high balance
AIMS Mathematics | 2022-04-25 | Paper |
Diophantine approximation over primes with different powers
Applied Mathematics and Computation | 2022-03-04 | Paper |
On tree-connectivity and path-connectivity of graphs
Graphs and Combinatorics | 2021-11-30 | Paper |
A survey on the Wiener polarity index
| 2021-11-26 | Paper |
Rainbow numbers for paths in planar graphs
Applied Mathematics and Computation | 2021-11-09 | Paper |
The restrained double Roman domination and graph operations
| 2021-11-08 | Paper |
Exact rainbow numbers for matchings in plane triangulations
Discrete Mathematics | 2021-03-25 | Paper |
The Parallel Seeding Algorithm for k-Means Problem with Penalties
Asia-Pacific Journal of Operational Research | 2021-02-11 | Paper |
The independent transversal total domination number of some graphs
| 2020-11-12 | Paper |
The annihilation number and the total domination number of a tree-like graph
Applied Mathematics and Computation | 2020-05-14 | Paper |
The annihilation number does not bound the 2-domination number from the above
Discrete Mathematics | 2020-04-21 | Paper |
The seeding algorithm for \(k\)-means problem with penalties
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Note on the perfect Roman domination number of graphs
Applied Mathematics and Computation | 2020-01-14 | Paper |
Note on improper coloring of 1-planar graphs.
Czechoslovak Mathematical Journal | 2019-12-18 | Paper |
On the double Roman domination of graphs
Applied Mathematics and Computation | 2019-11-15 | Paper |
Note on the perfect EIC-graphs
Applied Mathematics and Computation | 2019-03-21 | Paper |
Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
Applied Mathematics and Computation | 2019-03-19 | Paper |
Injective coloring of some graph operations
Applied Mathematics and Computation | 2018-08-22 | Paper |
Proper connection number of bipartite graphs.
Czechoslovak Mathematical Journal | 2018-06-15 | Paper |
On the generalized Wiener polarity index of trees with a given diameter
Discrete Applied Mathematics | 2018-05-24 | Paper |
Coupon coloring of some special graphs
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
Note on a Turán-type problem on distances.
Ars Combinatoria | 2016-05-04 | Paper |
Rainbow connections for outerplanar graphs with diameter 2 and 3
Applied Mathematics and Computation | 2016-04-28 | Paper |
Proper connection number and connected dominating sets
Theoretical Computer Science | 2015-12-11 | Paper |
The Wiener polarity index of graph products.
| 2015-10-27 | Paper |
The generalized 3-edge-connectivity of lexicographic product graphs
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Note on the spanning-tree packing number of lexicographic product graphs
Discrete Mathematics | 2015-01-30 | Paper |
Lower bounds for the spanning tree numbers of two graph products
| 2013-07-09 | Paper |
Note on the oriented diameter of graphs with diameter 3
| 2011-09-06 | Paper |
On independent domination and packing numbers of subcubic graphs
| N/A | Paper |
