Department of Mathematical Sciences Yazd University, Yazd, 89195-741, Iran
Saeid Alikhani, M. Mehraban, H. Golmohammadi, A. Zakharov
In this paper: A non-empty subset S ⊆ V of the vertex set of a simple graph G = (V, E) is called an independent dominating set if every vertex not in S is adjacent to at least one vertex in S, and no two vertices in...
Nima Ghanbari, Mohammad Ali Dehghanizadeh, Saeid Alikhani
In this paper: The overall variation in vertex connections within a graph, known as the total irregularity, is quantified by summing half the absolute differences between the degrees of every vertex pair. This study...
Nima Ghanbari, Saeid Alikhani
In this paper: The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of √d2i +d2j, where di is the degree of the i-th vertex. It has been conceived us...
M. Mehraban, Saeid Alikhani
In this paper: We study the independent domination bondage number in simple graphs. An independent dominating set S of a graph G is characterized by two conditions: its vertices are not adjacent to each other, and a...
Mohammad Wali Hairan, Ali Delavarkhalafi, Saeid Alikhani
In this paper: We study a novel approach based on game theory for the identification of overlapping associations and hierarchical structures within a social network. The approach models association detection as a co...
Nima Ghanbari, Saeid Alikhani
In this paper: Let G = (V, E) be a finite simple graph. The Sombor index SO(G) of G is defined as ΣuvϵE(G) √d2u+d2v, where du is the degree of vertex u in G. We consider the Sombor polynomial (function) as S(G, x)...
Saeid Alikhani, Maryam Safazadeh
In this paper: Let G = (V, E) be a simple graph. A dominating set of G is a subset D ⊆ V such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of the smallest dominating set of G,...
Install TARU PUBLICATIONSFaster access from your home screen