The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 221 –
240 of
430
We prove that if the Walsh bipartite map of a regular oriented hypermap is also orientably regular then both and have the same chirality group, the covering core of (the smallest regular map covering ) is the Walsh bipartite map of the covering core of and the closure cover of (the greatest regular map covered by ) is the Walsh bipartite map of the closure cover of . We apply these results to the family of toroidal chiral hypermaps induced by the family of toroidal bipartite maps...
In this paper, we have studied the connectedness of the graphs on the direct product of the Weyl groups. We have shown that the number of the connected components of the graph on the direct product of the Weyl groups is equal to the product of the numbers of the connected components of the graphs on the factors of the direct product. In particular, we show that the graph on the direct product of the Weyl groups is connected iff the graph on each factor of the direct product is connected.
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d colors that is not preserved by any nontrivial automorphism. The restriction to proper labelings leads to the definition of the distinguishing chromatic number of G.
Extending these concepts to infinite graphs we prove that and , where denotes the hypercube of countable dimension. We also show that , thereby completing the investigation of finite hypercubes with respect to .
Our results...
In the first part, we assign to each positive integer a digraph whose set of vertices consists of elements of the ring with the addition and the multiplication operations modulo and for which there is a directed edge from to if and only if . Associated with are two disjoint subdigraphs: and whose union is The vertices of are coprime to and the vertices of are not coprime to In this part, we study the structure of in detail. In the second part, we investigate the zero-divisor...
In a manner analogous to a commutative ring, the L-ideal-based L-zero-divisor graph of a commutative ring R can be defined as the undirected graph Γ(μ) for some L-ideal μ of R. The basic properties and possible structures of the graph Γ(μ) are studied.
Currently displaying 221 –
240 of
430