• Log in
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    Communities & CollectionsTitlesAuthorsSubjectsDate
    Log in
    AuthorHarary, Frank (3)Palmer, Edgar M. (1)Read, Ronald C. (2)TopicSocial Sciences (3)Subtopic
    Psychology (3)
    Date Issued1967 (1)1966 (1)1964 (1)Peer reviewedPeer Reviewed (3)

    Legend

    Restricted to current U-M faculty, staff, and students Limited access: U-M users onlyRequest Copy Access by requestHathi Access via HathiTrustFulcrum Access via Fulcrum
    Search Results 
    •   Home
    • Research Collections
    • Mathematical Geography, Institute of (IMaGe)
    • Search Results
    •  
      Home
    • Research Collections
    • Mathematical Geography, Institute of (IMaGe)
    • Search Results

    Search Results

    Show FiltersHide Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-3 of 3

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 10
    • 25
    • 50
    • 100

    The number of ways to label a structure 

    Harary, Frank; Palmer, Edgar M.; Read, Ronald C. (Springer-Verlag; Psychometric Society, 1967-06)
    It has been observed that the number of different ways in which a graph with p points can be labelled is p ! divided by the number of symmetries, and that this holds regardless of the species of structure at hand. In this ...
    PDF file (129.2KB)

    The probability of a given 1-choice structure 

    Harary, Frank; Read, Ronald C. (Springer-Verlag; Psychometric Society, 1966-06)
    A 1-choice structure arises whenever each person in a group chooses exactly one other person according to some criterion. Our purpose is to study the situation in which these choices are made at random. As noted in Harary, ...
    PDF file (294.3KB)

    A graph theoretic approach to similarity relations 

    Harary, Frank (Springer-Verlag; Psychometric Society, 1964-06)
    A similarity relation is reflexive and symmetric. A graph may be regarded as a geometric representation of an irreflexive symmetric relation; an r -graph then coincides with a similarity relation. For the realization of ...
    PDF file (473.8KB)

    University of Michigan Library

    • U-M Library
    • Michigan Publishing
    • Accessibility

    About Deep Blue Documents

    • Deep Blue Repositories
    • Contact Us
    • Frequently Asked Questions

    Privacy and copyright

    Library Privacy Statement

    Works found in Deep Blue Documents are protected by copyright unless otherwise indicated.

    © 2023, Regents of the University of Michigan. Built with DSpace