View Item 

Show simple item record

The smallest graphs with certain adjacency properties

dc.contributor.authorExoo, Geoffreyen_US
dc.contributor.authorHarary, Franken_US
dc.date.accessioned2006-04-07T17:28:05Z
dc.date.available2006-04-07T17:28:05Z
dc.date.issued1980en_US
dc.identifier.citationExoo, Geoffrey, Harary, Frank (1980)."The smallest graphs with certain adjacency properties." Discrete Mathematics 29(1): 25-32. <http://hdl.handle.net/2027.42/23351>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6V00-45FCTSH-7H/2/2d9b2b28f639ae5acd5c0d34dd4417f2en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/23351
dc.description.abstractA graph is said to have property P1,n if for every sequence of n + 1 points, there is another point adjacent only to the first point. It has previously been shown that almost all graphs have property P1,n. It is easy to verify that for each n, there is a cube with this property. A more delicate question asks for the construction of the smallest graphs having property P1,n. We find that this problem is intimately related with the discovery of the highly symmetric graphs known as cages, and are thereby enabled to resolve this question for 1[les]n[les]6.en_US
dc.format.extent776102 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleThe smallest graphs with certain adjacency propertiesen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan, Ann Arbor, MI 48109, U.S.A.en_US
dc.contributor.affiliationumUniversity of Michigan, Ann Arbor, MI 48109, U.S.A.en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/23351/1/0000294.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0012-365X(90)90283-Nen_US
dc.identifier.sourceDiscrete Mathematicsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000294.pdf
Size:
757.9KB
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.