On the edge and total GA indices of some graphs

on the edge and total ga indices of some graphs

On the Edge and Total GA Indices of Nanotubes

The total version of geometric–arithmetic (GA) index of graphs is introduced based on the end-vertex degrees of edges of their total graphs. In this paper, the total GA index is computed for zigzag polyhex nanotubes by using some results on GA index and mentioned nanotubes. Also, we compute the edge GA index for the subdivision graphs of TUC C (R) and TUAC [p',q'] nanotubes. 4 8 6

Some results on vertex-edge Wiener polynomials and indices of graphs

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

On the Wiener Index of Some Edge Deleted Graphs

The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.

On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...