New Results on Edge Rotation Distance Graphs
نویسندگان
چکیده
منابع مشابه
note on edge distance-balanced graphs
edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.
متن کاملOn the rotation distance of graphs
Let (x,y) be an edge of a graph G. Then the rotation of (x, y) about xis the operation of removing (x, y) from G and inserting (x, y') as an edge, where y' is a vertex of G. The rotation distance between graphs G and H is the minimum number of rotations necessary to transform G into H. Lower and upper bounds are given on the rotation distance of two graphs in terms of their greatest common subg...
متن کاملEdge-distance-regular graphs
Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root....
متن کاملNew results on edge partitions of 1-plane graphs
A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a 1-plane graph such that any two pairs of crossing edges share at most one endvertex. An edge partition of a 1-plane graph G is a coloring of the edges of G with two colors, red and blue, such that both the graph induced by the red edges and the graph induced by the blue edges are...
متن کاملNEW RESULTS ON THE EXISTING FUZZY DISTANCE MEASURES
In this paper, we investigate the properties of some recently pro-posed fuzzy distance measures. We find out some shortcomings for these dis-tances and then the obtained results are illustrated by solving several examplesand compared with the other fuzzy distances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Soft Computing
سال: 2016
ISSN: 2319-5215,2249-3328
DOI: 10.26708/ijmsc.2016.1.6.07