let g and h be two graphs. the corona product g o h is obtained by taking one copy of gand |v(g)| copies of h; and by joining each vertex of the i-th copy of h to the i-th vertex of g,i = 1, 2, …, |v(g)|. in this paper, we compute pi and hyper–wiener indices of the coronaproduct of graphs.

A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...

Inspired by the success of Google’s Pregel, many systems have been developed recently for iterative computation over big graphs. These systems provide a user-friendly vertex-centric programming interface, where a programmer only needs to specify the behavior of one generic vertex when developing a parallel graph algorithm. However, most existing systems require the input graph to reside in memo...

The research of Boolean index sets of graphs is one of the important graph theory in the graph theory. Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to 2 Z . Its theory can be applied to information engineering, communication networks...

Let G be a graph with vertex set V(G) and edge set E(G), and let A = {O, I}. A labeling f: V(G) ~ A induces a partial edge labeling f* : E(G) ~ A defined by f*(xy) = f(x), if and only if f(x) = fey), for each edge xy E E(G). For i E A, let vrt:i) = card{v E V(G): ftv) = i} and ep(i) = card{e E E(G): f*(e) i}. A labeling f ofa graph G is said to be friendly if I vrt:O) vrt: I) 1 s: I. If 1 ep(O)...

The research of Boolean index sets of graphs is one of the most important graph theories in the graph theory . Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to 2 Z . It’s theory can be applied to information engineering, communication...

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...