Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Movarraei Nazanin"'
Autor:
Hinz Andreas M., Movarraei Nazanin
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 1095-1109 (2020)
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, but structurally simpler Sierpiński graphs Snp. The most outstanding open problem is to find the domination number of Hanoi graphs. Here we concentrate
Externí odkaz:
https://doaj.org/article/351bf41ff2e045f092e7a39f515b8eb9
Autor:
Akbari, Saieed, Dolatabadi, Reza Hosseini, Jamaali, Mohsen, Klavžar, Sandi, Movarraei, Nazanin
The $\Delta$-edge stability number ${\rm es}_{\Delta}(G)$ of a graph $G$ is the minimum number of edges of $G$ whose removal results in a subgraph $H$ with $\Delta(H) = \Delta(G)-1$. Sets whose removal results in a subgraph with smaller maximum degre
Externí odkaz:
http://arxiv.org/abs/2403.05254
The chromatic vertex (resp.\ edge) stability number ${\rm vs}_{\chi}(G)$ (resp.\ ${\rm es}_{\chi}(G)$) of a graph $G$ is the minimum number of vertices (resp.\ edges) whose deletion results in a graph $H$ with $\chi(H)=\chi(G)-1$. In the main result
Externí odkaz:
http://arxiv.org/abs/2108.12994
Autor:
Akbari, Saieed, Beikmohammadi, Arash, Brešar, Boštjan, Dravec, Tanja, Habibollahi, Mohammad Mahdi, Movarraei, Nazanin
Given a non-trivial graph $G$, the minimum cardinality of a set of edges $F$ in $G$ such that $\chi'(G \setminus F)<\chi'(G)$ is called the chromatic edge stability index of $G$, denoted by $es_{\chi'}(G)$, and such a (smallest) set $F$ is called a (
Externí odkaz:
http://arxiv.org/abs/2108.10657
The chromatic edge-stability number ${\rm es}_{\chi}(G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph $G'$ with $\chi(G')=\chi(G)-1$. Edge-stability critical graphs are introduced as the graphs $G$ with t
Externí odkaz:
http://arxiv.org/abs/1905.12318
Autor:
Akbari, Saieed, Beikmohammadi, Arash, Brešar, Boštjan, Dravec, Tanja, Habibollahi, Mohammad Mahdi, Movarraei, Nazanin
Publikováno v:
In European Journal of Combinatorics June 2023 111
Publikováno v:
In European Journal of Combinatorics May 2022 102
Publikováno v:
In Discrete Mathematics June 2020 343(6)
Publikováno v:
In European Journal of Combinatorics February 2020 84
Autor:
Movarraei, Nazanin
In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of paths of lengths 6 and 7 those contain a specific vertex $v_{i}$ in a simple graph G, in terms of the adjacency matrix and with the help of combinatorics.
Externí odkaz:
http://arxiv.org/abs/1405.6272