Search Results - "Sheikholeslami, Seyed Mahmoud"

The Expected Values of Hyper Zagreb and Forgotten Topological Indices in Random Phenylene Chains by Shooshtari, Hajar, Sheikholeslami, Seyed Mahmoud, Amjadi, Jafar

“…Hexagonal chains are a special class of data condensed benzenoid system and phenylene chains are a class of polycyclic aromatic compounds. In this paper, we…”
Get full text

Outer independent total double Italian domination number by Sheikholeslami, Seyed Mahmoud, Volkmann, Lutz

“…If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $u\in V(G)$. A total double Italian dominating function…”
Get full text

Total Italian domatic number of graphs by Sheikholeslami, Seyed Mahmoud, Volkmann, Lutz

“…Let $G$ be a graph with vertex set $V(G)$. An \textit{Italian dominating function} (IDF) on a graph $G$ is a function $f:V(G)\longrightarrow \{0,1,2\}$ such…”
Get full text

The Roman Domatic Problem in Graphs and Digraphs: A Survey by Chellali, Mustapha, Rad, Nader Jafari, Sheikholeslami, Seyed Mahmoud, Volkmann, Lutz

“…In this paper, we survey results on the Roman domatic number and its variants in both graphs and digraphs. This fifth survey completes our works on Roman…”
Get full text

On the total double Roman domination by Shao, Zehui, Amjadi, Jafar, Sheikholeslami, Seyed Mahmoud, Valinavaz, Mina

“…Let G=(V,E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0,1,2,3} such that if f(u)=0,…”
Get full text

Signed Total Strong Roman Domination in Graphs by Maryam Hajjari, Seyed Mahmoud Sheikholeslami

Get full text

On The Total Roman Domination in Trees by Amjadi, Jafar, Sheikholeslami, Seyed Mahmoud, Soroudi, Marzieh

“…A on a graph is a function : ( ) → {0, 1, 2} satisfying the following conditions: (i) every vertex for which ) = 0 is adjacent to at least one vertex for which…”
Get full text

Bounds on the global double Roman domination number in graphs by Hao, Guoliang, Wei, Shouliu, Sheikholeslami, Seyed Mahmoud, Chen, Xiaodan

Get full text

On two conjectures concerning total domination subdivision number in graphs by Khoeilar, Rana, Karami, Hossein, Sheikholeslami, Seyed Mahmoud

“…A subset S of vertices of a graph G without isolated vertex is a total dominating set if every vertex of V ( G ) is adjacent to some vertex in S . The total…”
Get full text

Italian Reinforcement Number in Graphs by Hao, Guoliang, Sheikholeslami, Seyed Mahmoud, Wei, Shouliu

“…An Italian dominating function (IDF) on a graph G = (V, E) is a function f:V → {0, 1, 2} satisfying the condition that for every vertex v ∈ V with f(v)=0,…”
Get full text

RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS by Kosari, Saeed, Sheikholeslami, Seyed Mahmoud, Chellali, Mustapha, Hajjari, Maryam

“…A restrained Roman dominating function (RRD-function) on a graph \(G=(V,E)\) is a function \(f\) from \(V\) into \(\{0,1,2\}\) satisfying: (i)  every vertex…”
Get full text

Outer-Independent Italian Domination in Graphs by Fan, Wenjie, Ye, Ansheng, Miao, Fang, Shao, Zehui, Samodivkin, Vladimir, Sheikholeslami, Seyed Mahmoud

“…An outer-independent Italian dominating function (OIIDF) on a graph <inline-formula> <tex-math notation="LaTeX">G </tex-math></inline-formula> with vertex set…”
Get full text

Restrained reinforcement number in graphs by Haghparast, Kazhal, Amjadi, Jafar, Chellali, Mustapha, Sheikholeslami, Seyed Mahmoud

“…A set $S$ of vertices is a restrained dominating set of a graph $G=(V,E)$ if every vertex in $V\setminus S$ has a neighbor in $S$ and a neighbor in $V\setminus…”
Get full text

Signed Total Roman Edge Domination In Graphs by Asgharsharghi, Leila, Sheikholeslami, Seyed Mahmoud

“…Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2}…”
Get full text

Domination Number, Independent Domination Number and 2-Independence Number in Trees by Dehgardi, Nasrin, Sheikholeslami, Seyed Mahmoud, Valinavaz, Mina, Aram, Hamideh, Volkmann, Lutz

“…For a graph , let ) be the domination number, ) be the independent domination number and ) be the 2-independence number. In this paper, we prove that for any…”
Get full text

A Note on the Paired-Domination Subdivision Number of Trees by Qiang, Xiaoli, Kosari, Saeed, Shao, Zehui, Sheikholeslami, Seyed Mahmoud, Chellali, Mustapha, Karami, Hossein

“…For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this…”
Get full text

On the Paired-Domination Subdivision Number of Trees by Wei, Shouliu, Hao, Guoliang, Sheikholeslami, Seyed Mahmoud, Khoeilar, Rana, Karami, Hossein

“…A paired-dominating set of a graph G without isolated vertices is a dominating set of vertices whose induced subgraph has perfect matching. The minimum…”
Get full text

On the Paired-Domination Subdivision Number of a Graph by Hao, Guoliang, Sheikholeslami, Seyed Mahmoud, Chellali, Mustapha, Khoeilar, Rana, Karami, Hossein

“…In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no…”
Get full text

Outer-independent k-rainbow domination by Kang, Qiong, Samodivkin, Vladimir, Shao, Zehui, Sheikholeslami, Seyed Mahmoud, Soroudi, Marzieh

“…An outer-independent k-rainbow dominating function of a graph G is a function f from to the set of all subsets of such that both the following hold: (i)…”
Get full text

On the Outer-Independent Double Roman Domination of Graphs by Rao, Yongsheng, Kosari, Saeed, Sheikholeslami, Seyed Mahmoud, Chellali, M., Kheibari, Mahla

“…An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h : V ( G ) → { 0,1,2,3 } such that i) every vertex v with f ( v ) =…”
Get full text