Skip to search formSkip to main contentSkip to account menu

Frank Harary

Known as: Harary 
Frank Harary (March 11, 1921 – January 4, 2005) was an American mathematician, who specialized in graph theory. He was widely recognized as one of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Harary-Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph $K_n$ is… 
2015
2015
This study deals primarily with the connected closed geodetic numbers of some graphs, a closed geodetic closure invariant… 
2014
2014
A sum graph is a graph for which there is a labeling of its vertices with positive integers so that two vertices are adjacent if… 
2013
2013
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this… 
2009
2009
In this paper, chromatic polynomials of (non-uniform) hypercycles, unicyclic hypergraphs, hypercacti and sunflower hypergraphs… 
2008
2008
Carbon nanotubes are molecular-scale tubes of graphitic carbon with outstanding properties. They are among the stiffest and… 
1987
1987
For a graph G with distinguished vertices u and u, w e give a sufficient condition for the existence of a ( u , u)-trail… 
1984
1984
(1) This is paper 11 in the series “Systematic Synthesis Design“. For paper IO, see-fdotnote 2. (2) Hendrickson, J . B.; Toczko… 
1980
1980
In a inear forest, each component is a path. The linear arboricity ≡(G) of a graph G is defined in Harary [8] as the minimum… 
1978
1978
The psychological notion of cognitive balance by Cartwright and Harary offers a well-organized mode for consideration of systems…