Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Maimani, Hamid Reza"'
Publikováno v:
Discrete Math. 343 (2020), 112074
Given a $t$-$(v, k, \lambda)$ design, $\mathcal{D}=(X,\mathcal{B})$, a zero-sum $n$-flow of $\mathcal{D}$ is a map $f : \mathcal{B}\longrightarrow \{\pm1,\ldots, \pm(n-1)\}$ such that for any point $x\in X$, the sum of $f$ over all blocks incident wi
Externí odkaz:
http://arxiv.org/abs/2101.00867
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed graphs hav
Externí odkaz:
http://arxiv.org/abs/2003.09981
Autor:
Ghorbani, Modjtaba, Li, Xueliang, Maimani, Hamid Reza, Mao, Yaping, Rahmani, Shaghayegh, Rajabi-Parsa, Mina
The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least 2 and $S\subseteq V(G)$, the Steiner distance $d_G(S)$ of the
Externí odkaz:
http://arxiv.org/abs/1905.13621
Autor:
Ghorbani, Modjtaba, Klavžar, Sandi, Maimani, Hamid Reza, Momeni, Mostafa, Mahid, Farhad Rahimi, Rus, Gregor
A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number (gp-number) ${\rm gp
Externí odkaz:
http://arxiv.org/abs/1903.04286
Publikováno v:
Linear Algebra and its Applications 553 (2018), 104-116
A signed graph $\Gamma$ is said to be determined by its spectrum if every signed graph with the same spectrum as $\Gamma$ is switching isomorphic with $\Gamma$. Here it is proved that the path $P_n$, interpreted as a signed graph, is determined by it
Externí odkaz:
http://arxiv.org/abs/1709.09853
For a graph $G=(V,E)$ of order $n$, a Roman $\{2\}$-dominating function $f:V\rightarrow\{0,1,2\}$ has the property that for every vertex $v\in V$ with $f(v)=0$, either $v$ is adjacent to a vertex assigned $2$ under $f$, or $v$ is adjacent to least tw
Externí odkaz:
http://arxiv.org/abs/1701.01416
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ghorbani Modjtaba, Maimani Hamid Reza, Momeni Mostafa, Mahid Farhad Rahimi, Klavžar Sandi, Rus Gregor
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 4, Pp 1199-1213 (2021)
A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number (gp-number) gp(G) of G. The gp-n
Externí odkaz:
https://doaj.org/article/a845548719f14b18ae2b7f348a70919f
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Applied Mathematics 1 December 2019 271:84-92