In this paper we shall use the terminology of [1]. Let be a simple graph with vertex set and edge set. Let,. For every, the open neighborhood of, denoted by, is a set and the closed neighborhood of, ...

Abstract: Let G = (V, E) be a simple graph, k (1 ¿ k ¿ ¿(G) +1) is a positive integer, f is a mapping from V(G) ¿ E(G) to {1,2, ···, k} such that ¿uv ¿ E(G),f(u) ¿ f(v) and C(u) = C(v) if d(u) = d(v), ...

Abstract: There exists a mapping f: E (g)→{1,2, …, Q}, for an undirected connected graph G (p, q), where p is the number of vertices and q is the number of edges, the associated edges of those ...

edge_list_W5 = [(1,2), (1,3), (1,4), (1,5), (1,6), (2,3), (3,4), (4,5), (5,6), (6,2)] #Wheel graph W5 (the only non-word-representable graph on 6 vertices) Non_wr_6 ...

The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple ...

vertex_adjacency_graph gives a graph with vertices as node and can be travesed. However, I need a vertex_adjacency_graph with attributes in it, like "normals of the vertex", "color of the vertex". How ...

The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete ...