Antimagicness of Generalized Corona and Snowflake Graphs

详细信息    查看全文

• 作者：Jacqueline W. Daykin (1) (2)
  Costas S. Iliopoulos (2)
  Mirka Miller (2) (3) (4)
  Oudone Phanalasy (3) (5)
  
  1. Department of Computer Science ; Royal Holloway ; University of London ; Surrey ; UK
  2. Department of Informatics ; King鈥檚 College London ; London ; UK
  3. School of Mathematical and Physical Sciences ; University of Newcastle ; Newcastle ; Australia
  4. Department of Mathematics ; University of West Bohemia ; Pilsen ; Czech Republic
  5. Department of Mathematics ; National University of Laos ; Vientiane ; Laos
  
• 关键词：Antimagic labeling ; Sequential generalized corona graph ; Generalized snowflake graph ; 05C78
• 刊名：Mathematics in Computer Science
• 出版年：2015
• 出版时间：March 2015
• 年：2015
• 卷：9
• 期：1
• 页码：105-111
• 全文大小：233 KB
• 参考文献：1. Alon N., Kaplan G., Lev A., Roditty Y., Yuster R.: Dense graphs are antimagic. J. Graph Theory 47(4), 297鈥?09 (2004) 2/jgt.20027" target="_blank" title="It opens in new window">CrossRef
  2. Arumugam S., Miller M., Phanalasy O., Ryan J.: Antimagic labeling of generalized pyramid graphs. Acta Math. Sin. (Engl. Ser.) 30(2), 283鈥?90 (2014) 2381-7" target="_blank" title="It opens in new window">CrossRef
  3. Ba膷a M., Miller M.: Super Edge-Antimagic Graphs: A Wealth of Problems and Some Solutions. Brown Walker Press, Boca Raton (2008)
  4. Bloom G.S., Golomb S.W.: Applications of numbered undirected graphs. Proc. IEEE 65, 562鈥?70 (1977) CrossRef
  5. Bloom, G.S., Golomb, S.W.: Numbered complete graphs, unusual rulers and assorted applications. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 53鈥?5. Springer, New York (1978)
  6. Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hung. 18, 25鈥?6 (1967). doi:10.1007/BF02020961 . MR 0221974
  7. Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 19 ( \({\sharp}\) DS6), 1鈥?80 (2013)
  8. Hartsfield, N., Ringel G.: Pearls in Graph Theory: A Comprehensive Introduction. Academic Press Inc., Boston (1990)
  9. Hawick K.A., Leist A., Playne D.P.: Parallel graph component labelling with GPUs and CUDA. Parallel Comput. 36(12), 655鈥?78 (2010) 2010.07.002" target="_blank" title="It opens in new window">CrossRef
  10. Krishnaa A.: A study of the major graph labelings of trees. Informatica 15(4), 515鈥?24 (2004)
  11. Miller M., Phanalasy O., Ryan J., Rylands L.: Sparse graphs with vertex antimagic edge labelings. AKCE Int. J. Graphs Comb. 10(2), 193鈥?98 (2013)
  12. O鈥機onnell, T.C.: A survey of graph algorithms in extensions to the streaming model of computation. http://www.skidmore.edu/~toconnel/pub/oconnellGraphStream.pdf
  13. Rylands L., Phanalasy O., Ryan J., Miller M.: An application of completely separating systems to graph labeling. LNCS 8288, 376鈥?87 (2013)
  14. Wang T.M., Hsiao C.C.: On anti-magic labelling for graphs. Discrete Math. 308, 3624鈥?633 (2008) 2007.07.027" target="_blank" title="It opens in new window">CrossRef
  15. Zhang Y., Sun X.: The antimagicness of the Cartesian product of graphs. Theor. Comput. Sci. 410, 727鈥?35 (2009) 2008.10.023" target="_blank" title="It opens in new window">CrossRef
  
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Mathematics
  Computer Science, general
  
• 出版者：Springer Basel
• ISSN：1661-8289

文摘

This paper provides constructions of antimagic labelings of two families of graphs, namely, sequential generalized corona graphs and generalized snowflake graphs. The labelings can also be used for some families of antimagic trees which are special cases of these families. Future lines of research for antimagic graph labelings are proposed.