• No results found

[PDF] Top 20 On the revised edge-Szeged index of graphs

Has 10000 "On the revised edge-Szeged index of graphs" found on our website. Below are the top 20 most common "On the revised edge-Szeged index of graphs".

On the revised edge-Szeged index of graphs

On the revised edge-Szeged index of graphs

... and edge set ( ...pendant edge of , if one of its endpoints is a pendent ...the edge of and adding an edge between and , respectively. An edge is called a cut ... See full document

15

Computing Szeged index of graphs on ‎triples

Computing Szeged index of graphs on ‎triples

... Let G = (V,E) be a simple graph with vertex set V and edge set E. An automorphism of G is a one–to–one mapping  : V  V that preserves adjacency of vertices in G. The distance between two vertices u and v is the ... See full document

6

PI, Szeged and Revised Szeged Indices of IPR Fullerenes

PI, Szeged and Revised Szeged Indices of IPR Fullerenes

... method for some small numbers of n. Using our program we obtain seven exceptional cases that n = 1, 2, 3, 4, 5, 6 and 7 for Szeged and revised Szeged indices and three exceptional cases that n = 1, 2 ... See full document

13

A N‎ote on Revised Szeged ‎Index of ‎Graph ‎Operations

A N‎ote on Revised Szeged ‎Index of ‎Graph ‎Operations

... the revised Szeged index of the Cartesian product of two connected ...the revised Szeged index of the join and corona product of ... See full document

7

Resistance Distance and Kirchhoff Index of Two Edge-subdivision Corona Graphs

Resistance Distance and Kirchhoff Index of Two Edge-subdivision Corona Graphs

... Manuscript received August 18, 2018, revised November 23, 2018. This work was supported by the National Natural Science Foundation of China (Nos. 11461020), the Research Foundation of the Higher Education Institu- ... See full document

7

TC C R Nanotorus, H-Naphtalenic nanotubes and

TC C R Nanotorus, H-Naphtalenic nanotubes and

... as graphs in which each vertex represents an atom of molecule and covalent bounds between atoms are represented by edges between the corresponding ...of edge dividing, we report several distance-based ... See full document

19

Szeged Related Indices of Unilateral Polyomino Chain and Unilateral Hexagonal Chain

Szeged Related Indices of Unilateral Polyomino Chain and Unilateral Hexagonal Chain

... PI index, vertex PI index, Szeged index, edge Szeged index and atom bond connectivity index of molecular graphs, the study of edge-vertex ... See full document

13

On Edge-Szeged & G/A Edge-Szeged Index of Standard Graphs

On Edge-Szeged & G/A Edge-Szeged Index of Standard Graphs

... Wiener Index (see [6]) is the first topological index based on ...significant index is due to Gutman (see [3]) based on the nearity of vertices relative to the edges of the ...mean index ... See full document

12

Some Topological Indices of Edge Corona of Two Graphs

Some Topological Indices of Edge Corona of Two Graphs

... Wiener index is a classical distance based topological ...Wiener index has been extensively studied by many chemists and ...Wiener index the reader may refer to [5, 6, 12, 16, ... See full document

14

On K Edge Index and Coindex of Graphs
Gaussian Quadrature Rule

On K Edge Index and Coindex of Graphs Gaussian Quadrature Rule

... this index can enhance the physico-chemical applicability of Zagreb ...K-edge index which is defined as the sum of the cubes of the edge degrees of a ...K-edge index, ... See full document

6

Applications of Graph Operations

Applications of Graph Operations

... A graph G with a specified vertex subset U V(G) is denoted by G(U). Suppose G and H are graphs and U  V(G). The generalized hierarchical product, denoted by G(U)H, is the graph with vertex set V(G) V(H) and ... See full document

7

Skew Chromatic Index of Circular Ladder Graphs

Skew Chromatic Index of Circular Ladder Graphs

... skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of ...chromatic index s(G) is the minimum number of colors ... See full document

7

The F–Index for some Special Graphs and some Properties of the F–Index

The F–Index for some Special Graphs and some Properties of the F–Index

... Throughout this paper, we only consider finite, connected, undirected and simple graphs. Let be such a graph with the vertex set ( ) and the edge set ( ). For a vertex ∈ ( ), ( ) denotes the degree of which ... See full document

13

Szeged Dimension and $PI_v$ Dimension of Composite Graphs

Szeged Dimension and $PI_v$ Dimension of Composite Graphs

... There are some graphs that are vertex transitive but with the dimensions of more than 1. For example see the Fig. 1. The approach using Corollary 2.2 was applied in [5]. Note that all edges of an edge ... See full document

13

On Sequential Join of Fuzzy Graphs

On Sequential Join of Fuzzy Graphs

... G ≤ ≤ with V i = p i , 1 ≤ ≤ i n . Also, the underlying set V is assumed to be finite and σ can be chosen in any manner so as to satisfy the definition of a fuzzy graph in all the examples and all these properties are ... See full document

9

On the edge reverse Wiener indices of TUC4C8(S) nanotubes

On the edge reverse Wiener indices of TUC4C8(S) nanotubes

... Firstly we state the relations among the reverse edge-Wiener index, the edge complementary Wiener index and vertex Wiener indices in graphs which vertices has degree 2 and 3.. Befor[r] ... See full document

11

On Corona Product of Two Fuzzy Graphs

On Corona Product of Two Fuzzy Graphs

... fuzzy graphs which is analogous to the concept corona product operation in crisp graph theory is ...an edge in corona product of fuzzy graphs is ...an edge in fuzzy graph formed by this ... See full document

6

On Thorny Fuzzy Graphs

On Thorny Fuzzy Graphs

... thorny graphs in crisp graph theory is defined. The degree of an edge in thorny fuzzy graphs is ...an edge in fuzzy graph formed by this operation in terms of the degree of edges in the given ... See full document

5

On Edge Neighborhood Graphs

On Edge Neighborhood Graphs

... Proof: By definition, no two vertices corresponding edges in Ne(G) are adjacent and no two vertices corresponding to open edge neighborhood sets in Ne(G) are adjacent.. Thus Ne(G) h[r] ... See full document

5

ON ARITHMETIC-GEOMETRIC INDEX (GA) AND EDGE GA INDEX

ON ARITHMETIC-GEOMETRIC INDEX (GA) AND EDGE GA INDEX

... the edge GA values of considered graphs is investigated, then it is observed that the results for the graphs L(W 2n ) and L(f n ), also L(SF n ), L(H n ) and L(G n ) are close to each ... See full document

10

Show all 10000 documents...