10 papers · 1 filter
M-Polynomial of Product Graphs
El-Mehdi Mehiri, Sandi Klavžar
The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomi…
On the variety of general position problems under vertex and edge removal
Jing Tian, Pakanun Dokyeesun, Sandi Klavžar
Let , , and be the total, the outer, and the dual general position number of a graph , respectively. This paper i…
On decycling and forest numbers of Cartesian products of trees
Ali Ghalavand, Sandi Klavžar, Ning Yang
The decycling number of a graph is the minimum number of vertices that must be removed to eliminate all cycles in . The forest number is the maximum numbe…
Total -coalition: bounds, exact values and an application to double coalition
Boštjan Brešar, Sandi Klavžar, Babak Samadi
Let $G=\big{(}V(G),E(G)\big{)}$ be a graph with minimum degree . A subset is called a total -dominating set if every vertex in has at least neighbor…
On the weak -metric dimension of Hamming graphs
Elena Fernandez, Sandi Klavzar, Dorota Kuziak +2
Given a connected graph , a set of vertices is a weak -resolving set of if for each two vertices , the sum of the values $|d_G(y,x)-d_G(z,x)|…
On the -edge stability number of graphs
Saieed Akbari, Reza Hosseini Dolatabadi, Mohsen Jamaali +2
The -edge stability number of a graph is the minimum number of edges of whose removal results in a subgraph with . Sets whose remo…