Page 1 Next

Displaying 1 – 20 of 67

Showing per page

Octonion multiplication and Heawood’s map

Bruno Sévennec (2013)

Confluentes Mathematici

In this note, the octonion multiplication table is recovered from a regular tesselation of the equilateral two timensional torus by seven hexagons, also known as Heawood’s map.

OD-characterization of almost simple groups related to L 2 ( 49 )

Liang Cai Zhang, Wu Jie Shi (2008)

Archivum Mathematicum

In the present paper, we classify groups with the same order and degree pattern as an almost simple group related to the projective special linear simple group L 2 ( 49 ) . As a consequence of this result we can give a positive answer to a conjecture of W. J. Shi and J. X. Bi, for all almost simple groups related to L 2 ( 49 ) except L 2 ( 49 ) · 2 2 . Also, we prove that if M is an almost simple group related to L 2 ( 49 ) except L 2 ( 49 ) · 2 2 and G is a finite group such that | G | = | M | and Γ ( G ) = Γ ( M ) , then G M .

On 2-periodic graphs of a certain graph operator

Ivan Havel, Bohdan Zelinka (2001)

Discussiones Mathematicae Graph Theory

We deal with the graph operator P o w ¯ defined to be the complement of the square of a graph: P o w ¯ ( G ) = P o w ( G ) ¯ . Motivated by one of many open problems formulated in [6] we look for graphs that are 2-periodic with respect to this operator. We describe a class of bipartite graphs possessing the above mentioned property and prove that for any m,n ≥ 6, the complete bipartite graph K m , n can be decomposed in two edge-disjoint factors from . We further show that all the incidence graphs of Desarguesian finite projective geometries...

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F . Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F . We show that the latter dependency can be made exponential in the rank difference rank ( F ) - rank ( H ) , which often makes a significant change.

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2007)

RAIRO - Theoretical Informatics and Applications

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F. We show that the latter dependency can be made exponential in the rank difference rank(F) - rank(H), which often makes a significant change.

On Cayley graphs of completely 0-simple semigroups

Shoufeng Wang, Yinghui Li (2013)

Open Mathematics

We give necessary and sufficient conditions for various vertex-transitivity of Cayley graphs of the class of completely 0-simple semigroups and its several subclasses. Moreover, the question when the Cayley graphs of completely 0-simple semigroups are undirected is considered.

On chirality groups and regular coverings of regular oriented hypermaps

Antonio Breda d'Azevedo, Ilda Inácio Rodrigues, Maria Elisa Fernandes (2011)

Czechoslovak Mathematical Journal

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 ( 3 , 3 , 3 ) b , c = 𝒲 - 1 { 6 , 3 } b , c induced by the family of toroidal bipartite maps...

On connectedness of graphs on direct product of Weyl groups

Samy A. Youssef, S. G. Hulsurkar (1995)

Archivum Mathematicum

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.

On distinguishing and distinguishing chromatic numbers of hypercubes

Werner Klöckl (2008)

Discussiones Mathematicae Graph Theory

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 χ D ( G ) of G. Extending these concepts to infinite graphs we prove that D ( Q ) = 2 and χ D ( Q ) = 3 , where Q denotes the hypercube of countable dimension. We also show that χ D ( Q ) = 4 , thereby completing the investigation of finite hypercubes with respect to χ D . Our results...

Currently displaying 1 – 20 of 67

Page 1 Next