Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-23T04:40:40.261Z Has data issue: false hasContentIssue false
  • English
  • Français

GRAPH LABELLING TECHNIQUES

Part of: Graph theory

Published online by Cambridge University Press:  15 August 2018

DUSHYANT KIRITBHAI TANNA
DUSHYANT KIRITBHAI TANNA*
Affiliation:
School of Mathematical and Physical Sciences, University of Newcastle, Callaghan, NSW 2308, Australia email [email protected]
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

graph theorygraph labelling

MSC classification

Primary: 05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 98 , Issue 3 , December 2018 , pp. 512 - 513
Copyright
© 2018 Australian Mathematical Publishing Association Inc. 

Footnotes

Thesis submitted to the University of Newcastle in June 2017; degree approved on 4 December 2017; supervisors Mirka Miller, Joe Ryan, Thomas Kalinowski, Andrea Semaničová-Feňovčiková and Jonathan Borwein.

References

Bača, M., Jendrol’, S., Miller, M. and Ryan, J., ‘Total irregular labelings’, Discrete Math. 307 (2007), 1378–1388.Google Scholar
Bača, M., Miller, M., Phanalasy, O. and Semaničová-Feňovčiková, A., ‘Constructions of antimagic labelings for some families of regular graphs’, J. Algorithms Comput. 44 (2013), 1–7.Google Scholar
Chartrand, G., Jacobson, M. S., Lehel, J., Oellermann, O. R., Ruiz, S. and Saba, F., ‘Irregular networks’, Congr. Numer. 64 (1988), 187–192.Google Scholar