1) Harary path
Harary路
2) Harary graph
Harary图
1.
The Harary graphs are of particular interest as models of communication networks since they are maximum connectivity graphs for some given possible vertex number n and edge number e.
在给定的顶点数n和边数e的所有图中,Harary图有最大的连通度[2en],因此它是一个较好的网络模型。
2.
We give the eccentric digraph and period of circulant graphs by algorithms,and characterize eccentric digraphs of Harary graphs.
研究了网络中点与点之间的距离关系,利用算法求出循环图的离心图及其周期,并刻划了Harary图的离心图。
3.
Precisely,we prove that the adjacence graph of a BIBD is-extendable,and Harary graphs are-factor-critica.
我们证明了一个对称设计的关联图是k可扩图,而Harary图则是n因子临界图。
3) elementary harary graph
基本Harary图
4) Harary index
Harary指数
1.
The Harary index of G is denned aswhere d(u, v) is the length of the shortest path between two distinct vertices u and v.
设G=(V,E)是一个简单的连通图,其中V和E分别为G的顶点集和边集,则图G的Harary指数是其中d(u,v)表示顶点u与v之间的距离。
5) Path
[英][pɑ:θ] [美][pæθ]
路
1.
Vertex-distinguishing edge-coloring of graphs with distance between path and circle less than 3 and 4;
路和圈的距离不大于3和4的点可区别边染色
2.
Star total coloring of generalized Mycielski s graphs with wheels and paths;
轮和路的广义Mycielski图的星全染色
3.
On the Adjacent Vertex Distinguishing Equitable Total Coloring of Join Graph of Two Paths;
关于路和路的联图的邻点可区别的均匀全染色
6) Paths
[英][pɑ:θ] [美][pæθ]
路
1.
Pseudo Greedy Algorithm and upper Bound for Hamiltonian Chromatic Number of Paths;
路的Hamiltonian色数的上界与伪贪婪算法
2.
The problem of paths with bounded length, being a variation and a generalization of Menger s theorem, is of very important significance in the design and analysis of real-time or fault-tolerant interconnection networks.
设给出了(h,(?))-η限长路径问题是图论中的Menger定理的变形和推广,在实时容错网络设计和分析中有重要意义。
补充资料：开东园路北至山脚因治路傍隙地杂植花草
【诗文】：
避俗从来恨不深，家园栽种偶成阴。
西连几曲菖蒲涧，东接无穷薝卜林。
乌臼谷寒迎野步，金沙泉冷洗尘襟。
清音可写吾诗拙，它日君来试抱琴。
【注释】：
【出处】：
避俗从来恨不深，家园栽种偶成阴。
西连几曲菖蒲涧，东接无穷薝卜林。
乌臼谷寒迎野步，金沙泉冷洗尘襟。
清音可写吾诗拙，它日君来试抱琴。
【注释】：
【出处】：
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条