A vertex labeling f ： V →Z2 of a simple graph G = （V, E） induces two edge labelings The friendly index set and the product-cordial index set of G are defined as the setsf is friendly}. In this paper we study and d...A vertex labeling f ： V →Z2 of a simple graph G = （V, E） induces two edge labelings The friendly index set and the product-cordial index set of G are defined as the setsf is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel 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 Euc...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μv Euclid(G),is the smallest positive integer n such that G∪N_(n) is vertex Euclidean.In this paper,we introduce some methods for deriving the vertex Euclidean properties of some simple graphs.展开更多
文摘A vertex labeling f ： V →Z2 of a simple graph G = （V, E） induces two edge labelings The friendly index set and the product-cordial index set of G are defined as the setsf is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel 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μv Euclid(G),is the smallest positive integer n such that G∪N_(n) is vertex Euclidean.In this paper,we introduce some methods for deriving the vertex Euclidean properties of some simple graphs.
