Antimagicness of some families of generalized graphs. (English)
Australas. J. Comb. 53, 179-190 (2012).
1
Construction for antimagic generalized web graphs. (English)
AKCE Int. J. Graphs Comb. 8, No. 2, 141-149 (2011).
2
On antimagic labeling for generalized web and flower graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 303-313 (2011).
3
On a relationship between completely separating systems and antimagic labeling of regular graphs. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 238-241 (2011).
4
On a relationship between completely separating systems and antimagic labeling of regular graphs (English)
IWOCA, 238-241 (2010).
5
On antimagic labeling for generalized web and flower graphs (English)
IWOCA, 303-313 (2010).
6
Matrix generators for exceptional groups of Lie type. (English)
J. Symb. Comput. 31, No.4, 429-445 (2001).
7
Matrix generators for the orthogonal groups. (English)
J. Symb. Comput. 25, No.3, 351-360 (1998).
8
Start
Contact
Print
General Help
