نتایج جستجو برای: harary index
تعداد نتایج: 396366 فیلتر نتایج به سال:
abstract. topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. graph theory is a delightful playground for the exploration of proof techniques in discrete mathematics and its results have applications in many areas of sciences. one of the us...
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of simila...
We prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least 7. We also make a remark on reconstruction of graphs from their higher powers.
A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterizing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterization is given in terms of fundamental cycles of a cycle basis.
Most analyses of world politics and studies of national security policies recognize the interdependence among the salient actors across the salient issues. Traditionally, international politics has been defined as the scope and extent of the relations among independent countries, thought to be the most important elements in world politics. This means that actors as well as their actions are str...
Lower bounds on the Ramsey number r(G, H), as a function of the size of the graphs G and H, are determined. In particular, if H is a graph with n lines, lower bounds for r(H) = r(H, H) and r(K,, H) are calculated in terms of n in the first case and m and n in the second case. For m = 3 an upper bound is also determined. These results partially answer a question raised by Harary about the relati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید