Do you want to publish a course? Click here

Orientable $mathbb{Z}{}_{n}$-distance magic regular graphs

143   0   0.0 ( 0 )
 Added by Pawe{\\l} Dyrlaga
 Publication date 2017
  fields
and research's language is English




Ask ChatGPT about the research

Hefetz, M{u}tze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation. In this paper we support the analogous question for distance magic labeling. Let $Gamma$ be an Abelian group of order $n$. A textit{directed $Gamma$-distance magic labeling} of an oriented graph $vec{G} = (V,A)$ of order $n$ is a bijection $vec{l}:V rightarrow Gamma$ with the property that there is a textit{magic constant} $mu in Gamma$ such that for every $x in V(G)$ $ w(x) = sum_{y in N^{+}(x)}vec{l}(y) - sum_{y in N^{-}(x)} vec{l}(y) = mu. $ In this paper we provide an infinite family of odd regular graphs possessing an orientable $mathbb{Z}_{n}$-distance magic labeling. Our results refer to lexicographic product of graphs. We also present a family of odd regular graphs that are not orientable $mathbb{Z}_{n}$-distance magic.



rate research

Read More

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $iin{1,ldots,u}$ of binary (respectively, extended binary) Hamming codes of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
78 - Yusuke Yoshie 2018
Characterizations graphs of some classes to induce periodic Grover walks have been studied for recent years. In particular, for the strongly regular graphs, it has been known that there are only three kinds of such graphs. Here, we focus on the periodicity of the Grover walks on distance-regular graphs. The distance-regular graph can be regarded as a kind of generalization of the strongly regular graphs and the typical graph with an equitable partition. In this paper, we find some classes of such distance-regular graphs and obtain some useful necessary conditions to induce periodic Grover walks on the general distance-regular graphs. Also, we apply this necessary condition to give another proof for the strong regular graphs.
222 - Hsin-Hao Lai , Ko-Wei Lih 2012
Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let m and M denote the minimum and the maximum of the number of dependent arcs over all acyclic orientations of G. We call G fully orientable if G has an acyclic orientation with exactly d dependent arcs for every d satisfying m <= d <= M. A graph G is called chordal if every cycle in G of length at least four has a chord. We show that all chordal graphs are fully orientable.
68 - J. Rif`a , V. Zinoviev 2015
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power $q$ and any two natural numbers $a,b$, we construct completely transitive codes over different fields with covering radius $rho=min{a,b}$ and identical intersection array, specifically, one code over $F_{q^r}$ for each divisor $r$ of $a$ or $b$. As a corollary, for any prime power $q$, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters. Under the same conditions, an explicit construction of an infinite family of $q$-ary uniformly packed codes (in the wide sense) with covering radius $rho$, which are not completely regular, is also given.
87 - Jia Huang 2020
A Norton algebra is an eigenspace of a distance regular graph endowed with a commutative nonassociative product called the Norton product, which is defined as the projection of the entrywise product onto this eigenspace. The Norton algebras are useful in finite group theory as they have interesting automorphism groups. We provide a precise quantitative measurement for the nonassociativity of the Norton product on the eigenspace of the second largest eigenvalue of the Johnson graphs, Grassman graphs, Hamming graphs, and dual polar graphs, based on the formulas for this product established in previous work of Levstein, Maldonado and Penazzi. Our result shows that this product is as nonassociative as possible except for two cases, one being the trivial vanishing case while the other having connections with the integer sequence A000975 on OEIS and the so-called double minus operation studied recently by Huang, Mickey, and Xu.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا