S. Klavžar

activity

20092026

most citedM-Polynomial and Degree-Based Topological Indices

81 citations · 214 across the 80 of their papers we have counts for

collaborators

Showing 2014Show all

4 papers · 1 filter

math.CO2014

Improved upper bounds on the domination number of graphs with minimum degree at least five

Csilla Bujtás, Sandi Klavžar

An algorithmic upper bound on the domination number $γ$ of graphs in terms of the order $n$ and the minimum degree $δ$ is proved. It is demonstrated that the bound improves best pr…

math.CO2014

Vertex and edge orbits of Fibonacci and Lucas cubes

Ali Reza Ashrafi, Jernej Azarija, Khadijeh Fathalikhani +2

The Fibonacci cube $Γ_{n}$ is obtained from the $n$ -cube $Q_{n}$ by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 a…

math.CO2014★ 81 cited

M-Polynomial and Degree-Based Topological Indices

Emeric Deutsch, Sandi Klavžar

Let $G$ be a graph and let $m_{ij} (G)$ , $i, j \geq 1$ , be the number of edges $uv$ of $G$ such that ${d_{v} (G), d_{u} (G)} = {i, j}$ . The {\em $M$ -polynomial} of $G$ is introduced with…

math.CO2014

On Isomorphism Classes of Generalized Fibonacci Cubes

Jernej Azarija, Sandi Klavžar, Jaehun Lee +2

The generalized Fibonacci cube $Q_{d} (f)$ is the subgraph of the $d$ -cube $Q_{d}$ induced on the set of all strings of length $d$ that do not contain $f$ as a substring. It is proved t…