Geodesic-pancyclic graphs

Hung-Chang Chan,Jou-Ming Chang,Yue-Li Wang,Shi-Jinn Horng

Discrete Applied Mathematics（2007）

引用 9|浏览1

暂无评分

摘要

shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v in a graph G, denoted by d"G(u,v), is the number of edges in a u-v geodesic. A graph G with n vertices is panconnected if, for each pair of vertices u,[email protected]__ __V(G) and for each integer k with d"G(u,v)=

查看译文

关键词

Hamiltonicity,Traceability,Pancyclicity,Vertex-pancyclicity,Edge-pancyclicity,Geodesic-pancyclicity,Panconnectivity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要