Every lobster is odd-elegant
Information Processing Letters（2013）
摘要
A graph G having q edges is odd-elegant if it admits a mapping f:V(G)-{0,1,2,...,2q-1} with f(u)f(v) for distinct u,v@?V(G), and the label f(uv) of every edge uv@?E(G) is defined as f(uv)=f(u)+f(v)(mod2q) such that the set of all edge labels is equal to {1,3,5,...,2q-1}. We show that every lobster is odd-elegant.
更多查看译文
关键词
q edge,edge label,edge uv,graph g,distinct u
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要