Search Results - "Harary, Frank"

Refine Results
  1. 1
  2. 2

    On the out-domination and in-domination numbers of a digraph by Chartrand, Gary, Harary, Frank, Yue, Bill Quan

    Published in Discrete mathematics (01-02-1999)
    “…An out-domination set of a digraph D is a set S of vertices of D such that every vertex of D− S is adjacent from some vertex of S. The minimum cardinality of…”
    Get full text
    Journal Article
  3. 3
  4. 4

    Destroying automorphisms by fixing nodes by Erwin, David, Harary, Frank

    Published in Discrete mathematics (28-12-2006)
    “…The fixing number of a graph G is the minimum cardinality of a set S ⊂ V ( G ) such that every nonidentity automorphism of G moves at least one member of S,…”
    Get full text
    Journal Article
  5. 5

    The City Is a Tree; The Real World Is Not a Tree by Harary, Frank

    Published in Geographical analysis (01-10-2011)
    “…The guest coeditors of this issue set a context in which to view a previously unpublished article of Frank Harary. The Harary article is followed here by…”
    Get full text
    Journal Article
  6. 6
  7. 7

    On the geodetic number of a graph by Chartrand, Gary, Harary, Frank, Zhang, Ping

    Published in Networks (01-01-2002)
    “…For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u − v geodesic in G. If S is a set of vertices of G, then I(S) is…”
    Get full text
    Journal Article
  8. 8

    Eccentricity and centrality in networks by Hage, Per, Harary, Frank

    Published in Social networks (1995)
    “…The classic concept of centrality discovered by Camille Jordan in the 19th century is introduced as a model for social network analysis. It is generalized to…”
    Get full text
    Journal Article
  9. 9

    A Structural Analysis of the Situation in the Middle East in 1956 by Harary, Frank

    Published in The Journal of conflict resolution (01-06-1961)
    “…We attempt to display a systematic approach for the distinction between states of equilibrium and disequilibrium in the interrelationships between nations,…”
    Get full text
    Journal Article
  10. 10

    The Cohesiveness of Blocks in Social Networks: Node Connectivity and Conditional Density by White, Douglas R., Harary, Frank

    Published in Sociological methodology (01-01-2001)
    “…This study shows several ways that formal graph theoretic statements map patterns of network ties into substantive hypotheses about social cohesion. If network…”
    Get full text
    Journal Article
  11. 11
  12. 12

    A GRAPH AND ITS COMPLEMENT WITH SPECIFIED PROPERTIES I: CONNECTIVITY by Akiyama, Jin, Harary, Frank

    “…We investigate the conditions under which both a graph G and its complement possess a specified property. In particular, we characterize all graphs G for which…”
    Get full text
    Journal Article
  13. 13

    Edge Sums Of De Bruijn Interconnection Networks by Ferrero, Daniela, Harary, Frank

    “…An interconnection network is a highly symmetrical connected graph of order n nodes, size m edges, connectivity κ and diameter d , where n and κ are large but…”
    Get full text
    Journal Article
  14. 14
  15. 15

    ON THE STRUCTURE OF A TRIANGLE-FREE INFINITE-CHROMATIC GRAPH OF GYARFAS by Eggan, Larry, Harary, Frank

    “…Gyarfas has recently constructed an elegant new example of a triangle-free infinite graph G with infinite chromatic number. We analyze its structure by…”
    Get full text
    Journal Article
  16. 16

    Unsolved Problems on Distance in Graphs by Buckley, Fred, Harary, Frank

    Published in Electronic notes in discrete mathematics (01-07-2002)
    “…The distance between a pair of nodes of a graph G is the length of a shortest path connecting them. The eccentricity of a node v is the greatest distance…”
    Get full text
    Journal Article
  17. 17

    A graph and its complement with specified properties III: girth and circumference by Akiyama, Jin, Harary, Frank

    “…In this series, we investigate the conditions under which both a graph G and its complement possess certain specified properties. We now characterize all the…”
    Get full text
    Journal Article
  18. 18

    Identity orientation of complete bipartite graphs by Harary, Frank, Ranjan, Desh

    Published in Discrete mathematics (28-02-2005)
    “…An identity orientation of a graph G = ( V , E ) is an orientation of some of the edges of E such that the resulting partially oriented graph has no…”
    Get full text
    Journal Article
  19. 19
  20. 20