View Item 

Show simple item record

A graph and its complement with specified properties. IV. Counting self‐complementary blocks
dc.contributor.authorAkiyama, Jin
dc.contributor.authorHarary, Frank
dc.date.accessioned2018-05-15T20:13:40Z
dc.date.available2018-05-15T20:13:40Z
dc.date.issued1981-03
dc.identifier.citationAkiyama, Jin; Harary, Frank (1981). "A graph and its complement with specified properties. IV. Counting self‐complementary blocks." Journal of Graph Theory 5(1): 103-107.
dc.identifier.issn0364-9024
dc.identifier.issn1097-0118
dc.identifier.urihttps://hdl.handle.net/2027.42/143656
dc.description.abstractIn this series, we investigate the conditions under which both a graph G and its complement G possess certain specified properties. We now characterize all the graphs G such that both G and G have the same number of endpoints, and find that this number can only be 0 or 1 or 2. As a consequence, we are able to enumerate the self‐complementary blocks.
dc.publisherWiley Subscription Services, Inc., A Wiley Company
dc.titleA graph and its complement with specified properties. IV. Counting self‐complementary blocks
dc.typeArticleen_US
dc.rights.robotsIndexNoFollow
dc.subject.hlbsecondlevelMathematics
dc.subject.hlbtoplevelScience
dc.description.peerreviewedPeer Reviewed
dc.contributor.affiliationumThe University of Michigan Ann Arbor, Michigan
dc.contributor.affiliationotherNippon Ika University Kawasaki, Japan
dc.description.bitstreamurlhttps://deepblue.lib.umich.edu/bitstream/2027.42/143656/1/3190050108_ftp.pdf
dc.identifier.doi10.1002/jgt.3190050108
dc.identifier.sourceJournal of Graph Theory
dc.identifier.citedreferenceJ. Akiyama and F. Harary, A graph and its complement with specified properties I: Connectivity. Internat. J. Math. and Math. Sci. 2 ( 1979 ) 223 – 228.
dc.identifier.citedreferenceJ. Akiyama and F. Harary, A graph and its complement with specified properties II: Unary operations. Nanta Math. To appear.
dc.identifier.citedreferenceJ. Akiyama and F. Harary, A graph and its complement with specified properties III: Girth and circumference. Internat. J. Math. and Math. Sci. 2 ( 1979 ) 685 – 692.
dc.identifier.citedreferenceR. Frucht and F. Harary, Self‐complementary generalized orbits of a permutation group. Canad. Math. Bull. 17 ( 1974 ) 203 – 208.
dc.identifier.citedreferenceF. Harary, Graph Theory. Addison‐Wesley, Reading, MA ( 1969 ).
dc.identifier.citedreferenceR. A. Gibbs, Self‐complementary graphs. J. Combinatorial Theory Ser. B 16 ( 1974 ) 106 – 123.
dc.identifier.citedreferenceR. C. Read, On the number of self‐complementary graphs and digraphs. J. London Math. Soc. 38 ( 1963 ) 99 – 104.
dc.identifier.citedreferenceG. Ringel, Selbstkomplementäre Graphen. Arch. Math. 14 ( 1963 ) 354 – 358.
dc.identifier.citedreferenceR. W. Robinson, Enumeration of non‐separable graphs. J. Combinatorial Theory 9 ( 1970 ) 327 – 356.
dc.identifier.citedreferenceH. Sachs, Über selbstkomplementäre Graphen, Publ. Math. Debrecen 9 ( 1962 ) 270 – 288.
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
3190050108_ftp.pdf
Size:
220.4KB
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.