典型文献
The Vertex Euclidean Properties of Graphs
文献摘要：
A simple graph G=(V,E)is said to be vertex Euclidean if there exists a bijection f from V to{1,2,....,|V |}such that f(u)+f(v)＞f(w)for each C3 subgraph with vertex set{u,v,w},where f(u)＜f(v)＜f(w).The vertex Euclidean deficiency of a graph G,denoted μvEuclid(G),is the smallest positive integer n such that G U Nn is vertex Euclidean.In this paper,we introduce some methods for deriving the vertex Euclidean properties of some simple graphs.
文献关键词：
中图分类号：
作者姓名：
Zhen Bin GAO;Meng WANG;Sin Min LEE;Harris KWONG;Shu Juan WANG
作者机构：
College of Mathematical Sciences,Harbin Engineering University,Harbin 150001,P.R.China;1786 Plan Tree Drive,Upland,CA 91784,USA;Dept.of Math.Sci.,SUNY Fredonia,Fredonia,NY 14063,USA
文献出处：
引用格式：
[1]Zhen Bin GAO;Meng WANG;Sin Min LEE;Harris KWONG;Shu Juan WANG-.The Vertex Euclidean Properties of Graphs)[J].数学学报（英文版）,2022(07):1185-1202
A类：
bijection,vEuclid
B类：
Vertex,Euclidean,Properties,Graphs,simple,said,be,vertex,if,there,exists,from,such,that,+f,each,C3,subgraph,set,where,deficiency,denoted,smallest,positive,integer,Nn,In,this,paper,we,introduce,some,methods,deriving,properties,graphs
AB值：
0.575811
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
