Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Haghighi, Mohammad Hassan Shirdareh"'
Autor:
Haghighi, Mohammad Hassan Shirdareh, Ghazanfari, Amir Mohammad, Fard, Seyed Ali Reza Talebpour Shirazi
For a graph $G$, a $k$-coloring $c:V(G)\to \{1,2,\ldots, k\}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c(v)=c(f(v))$ for every vertex $v\in G$ (color-preserving automorphism), is the identity. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2403.19264
Autor:
Shekarriz, Mohammad Hadi, Fard, Seyed Alireza Talebpour Shirazi, Ahmadi, Bahman, Haghighi, Mohammad Hassan Shirdareh, Alikhani, Saeid
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science (2022)
A vertex coloring of a graph $G$ is distinguishing if non-identity automorphisms do not preserve it. The distinguishing number, $D(G)$, is the minimum number of colors required for such a coloring and the distinguishing threshold, $\theta(G)$, is the
Externí odkaz:
http://arxiv.org/abs/2109.00045
Autor:
Shekarriz, Mohammad Hadi, Ahmadi, Bahman, Fard, Seyed Alireza Talebpour Shirazi, Haghighi, Mohammad Hassan Shirdareh
Publikováno v:
Journal of Graph Theory (2022)
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphisms of $G$ can preserve it. The distinguishing number of $G$, denoted by $D(G)$, is the minimum number of colors required for such a coloring, and the distinguishi
Externí odkaz:
http://arxiv.org/abs/2107.14767
Autor:
Nowbandegani, Pouria Salehi, Esfandiari, Hossein, Haghighi, Mohammad Hassan Shirdareh, Bibak, Khodakhast
The Erd\H{o}s-Gy\'{a}rf\'{a}s conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erd\H{o}s-Gy\'{a}rf\'{a}s conjectu
Externí odkaz:
http://arxiv.org/abs/1109.5398
Publikováno v:
Discrete Math., 311 (2011) 888--891
A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $A\subseteq V(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)\setminus A]$ are the same. In this paper, we characterize all degree-equipartite g
Externí odkaz:
http://arxiv.org/abs/1108.1606
Autor:
Nowbandegani Pouria Salehi, Esfandiari Hossein, Haghighi Mohammad Hassan Shirdareh, Bibak Khodakhast
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 3, Pp 635-640 (2014)
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-f
Externí odkaz:
https://doaj.org/article/0d9e05d710ad447c8e69848694a2cedc
