View Item 

Show simple item record

Harmonious groups
dc.contributor.authorBeals, Roberten_US
dc.contributor.authorGallian, Joseph A.en_US
dc.contributor.authorHeadley, Patricken_US
dc.contributor.authorJungreis, Douglasen_US
dc.date.accessioned2006-04-10T14:47:23Z
dc.date.available2006-04-10T14:47:23Z
dc.date.issued1991-03en_US
dc.identifier.citationBeals, Robert, Gallian, Joseph A., Headley, Patrick, Jungreis, Douglas (1991/03)."Harmonious groups." Journal of Combinatorial Theory, Series A 56(2): 223-238. <http://hdl.handle.net/2027.42/29431>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WHS-4D7D0GY-RC/2/8840fe5c3bf3b3ae086a9d4ac0cbca55en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/29431
dc.description.abstractIn this paper we introduce a method of sequencing the elements of a finite group that gives rise to a complete mapping of the group. Our definition was motivated by the concept of a harmonious graph invented by Graham and Sloane. Our concept has several connections to graph theory and as an application we complete the characterization of elegant cycles begun by Chang, Hsu, and Rogers. Our definitions are also variations of the notion of an R-sequenceable group first introduced by Ringel in his solution of the map coloring problem for all compact 2-dimensional manifolds except the sphere and expanded upon by Friedlander, Gordon, and Miller.en_US
dc.format.extent769889 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleHarmonious groupsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.contributor.affiliationotherDepartment of Computer Science, University of Chicago, Chicago, Illinois 60637, USAen_US
dc.contributor.affiliationotherDepartment of Mathematics and Statistics, University of Minnesota at Duluth, Duluth, Minnesota 55812, USAen_US
dc.contributor.affiliationotherDepartment of Mathematics, University of California at Berkeley, Berkeley, California 94720, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/29431/1/0000512.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0097-3165(91)90034-Een_US
dc.identifier.sourceJournal of Combinatorial Theory, Series Aen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000512.pdf
Size:
751.8KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.