On the number of unique subgraphs
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Schwenk, Allen J. | en_US |
dc.date.accessioned | 2006-04-17T16:35:35Z | |
dc.date.available | 2006-04-17T16:35:35Z | |
dc.date.issued | 1973-10 | en_US |
dc.identifier.citation | Harary, Frank, Schwenk, Allen J. (1973/10)."On the number of unique subgraphs." Journal of Combinatorial Theory, Series B 15(2): 156-160. <http://hdl.handle.net/2027.42/33805> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WHT-4D7BTVV-24/2/5cc76056fc6363a3ce2c1dedf11a8115 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/33805 | |
dc.description.abstract | Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lower bound for the maximum number of unique subgraphs in any n-point graph, which we now improve. | en_US |
dc.format.extent | 203936 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | On the number of unique subgraphs | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, Michigan 48104, USA | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, Michigan 48104, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/33805/1/0000060.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0095-8956(73)90015-4 | en_US |
dc.identifier.source | Journal of Combinatorial Theory, Series B | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
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.