Let G = (V;E) be a simple connected graph. The Wiener index is the sum of distances between all pairs of vertices of a connected graph. The Schultz topological index is equal to and the Modified Schultz topological in...Let G = (V;E) be a simple connected graph. The Wiener index is the sum of distances between all pairs of vertices of a connected graph. The Schultz topological index is equal to and the Modified Schultz topological index is . In this paper, the Schultz, Modified Schultz polynomials and their topological indices of Jahangir graphs J<sub>2,m</sub> for all integer number m ≥ 3 are calculated.展开更多
For a graph G and two positive integers j and k, an m-L（j, k）-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edg...For a graph G and two positive integers j and k, an m-L（j, k）-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edges which are distance two apart receive labels differ at least by k. The λj,k-number of G is the minimum m such that an m-L（j, k）-edge-labeling is admitted by G. In this article, the L（1, 2）-edge-labeling for the hexagonal lattice, the square lattice and the triangular lattice are studied, and the bounds for λj,k-numbers of these graphs are obtained.展开更多
文摘Let G = (V;E) be a simple connected graph. The Wiener index is the sum of distances between all pairs of vertices of a connected graph. The Schultz topological index is equal to and the Modified Schultz topological index is . In this paper, the Schultz, Modified Schultz polynomials and their topological indices of Jahangir graphs J<sub>2,m</sub> for all integer number m ≥ 3 are calculated.
基金Supported by the National Natural Science Foundation of China(10971025 and 10901035)
文摘For a graph G and two positive integers j and k, an m-L（j, k）-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edges which are distance two apart receive labels differ at least by k. The λj,k-number of G is the minimum m such that an m-L（j, k）-edge-labeling is admitted by G. In this article, the L（1, 2）-edge-labeling for the hexagonal lattice, the square lattice and the triangular lattice are studied, and the bounds for λj,k-numbers of these graphs are obtained.
