Zobrazeno 1 - 7
of 7
pro vyhledávání: '"MOHAMMAD HADI SHEKARRIZ"'
Autor:
Mohammad Hadi Shekarriz, Karl Svozil
We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum mechanical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40877a5e784e35bbc2d53d74e8691bb1
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 27-37 (2018)
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing edge-minimal 2
Autor:
MOHAMMAD HADI SHEKARRIZ1 mh.shekarriz@mail.um.ac.ir, MADJID MIRZAVAZIRI1 mirzavaziri@um.ac.ir, KAMYAR MIRZAVAZIRI2 mirzavaziri@gmail.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 1, p27-37. 11p. 2 Diagrams.
A vertex coloring of a graph G is called distinguishing (or symmetry breaking) if no non-identity automorphism of G preserves it, and the distinguishing number, shown by D ( G ) , is the smallest number of colors required for such a coloring. This pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4aa8a64baf1c7eb69e9895d68feab2c6
http://arxiv.org/abs/1910.12102
http://arxiv.org/abs/1910.12102
Publikováno v:
Communications in Algebra. 40:2798-2807
Let $R$ be a finite commutative ring with $1\ne 0$. In this article, we study the total graph of $R$, denoted by $\tau (R)$, determine some of its basic graph-theoretical properties, determine when it is Eulerian, and find some conditions under which
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, ordinary star-like selfcontained graphs are introduced and it is shown that every ordinary star-like self-contained graph has infin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55043dd6a7fe26ecf66f136ac9b42db2
Publikováno v:
BPP_AGH
Montanuniversität Leoben
Montanuniversität Leoben
We consider infinite graphs. The distinguishing number $D(G)$ of a graph $G$ is the minimum number of colours in a vertex colouring of $G$ that is preserved only by the trivial automorphism. An analogous invariant for edge colourings is called the di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::faf67aec8d9387a3b8809dd135fa4543
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p6
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p6