Blar i Department of Informatics på forfatter "Ghanbari, Nima"
-
Computational complexity aspects of super domination
Bujtás, Csilla; Ghanbari, Nima; Klavžar, Sandi (Journal article; Peer reviewed, 2023)Let G be a graph. A dominating set D ⊆ V (G) is a super dominating set if for every vertex x ∈ V (G) \ D there exists y ∈ D such that NG (y) ∩ (V (G) \ D)) = {x}. The cardinality of a smallest super dominating set of G is ... -
Introduction to total dominator edge chromatic number
Alikhani, Saeid; Ghanbari, Nima (Journal article, 2022)We introduce the total dominator edge chromatic number of a graph G. A total dominator edge coloring (briefly TDE-coloring) of G is a proper edge coloring of G in which each edge of the graph is adjacent to every edge of ... -
Mostar index and edge Mostar index of polymers
Ghanbari, Nima; Alikhani, Saeid (Journal article; Peer reviewed, 2021)Let G=(V,E) be a graph and e=uv∈E. Define nu(e,G) be the number of vertices of G closer to u than to v. The number nv(e,G) can be defined in an analogous way. The Mostar index of G is a new graph invariant defined as ... -
On the Sombor characteristic polynomial and Sombor energy of a graph
Ghanbari, Nima (Journal article; Peer reviewed, 2022)Let G be a simple graph with vertex set V(G)={v1,v2,…,vn}. The Sombor matrix of G, denoted by ASO(G), is defined as the n×n matrix whose (i, j)-entry is d2i+d2j−−−−−−√ if vi and vj are adjacent and 0 for another cases. Let ... -
On the strong dominating sets of graphs
Zaherifar, Hassan; Alikhani, Saeid; Ghanbari, Nima (Journal article, 2023) -
Total dominator chromatic number of k-subdivision of graphs
Alikhani, Saeid; Ghanbari, Nima; Soltani, Samaneh (Journal article, 2023)Let G be a simple graph. A total dominator coloring of G, is a proper coloring of the vertices of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic (TDC) ...