Wiener Index of Directed and Weighted Graphs by MATLAB Program

Thilakam, K.; Sumathi, A.

doi:10.9790/5728-10556771

Cited by 2 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If G is a molecular graph with n nodes, then its adjacency matrix A ij is a square matrix of order n defined as a ij = 1, if there is an link between i th and j th nodes, a ij = 0, if there is no link between them. The Program for finding Wiener index of any graphs through Adjacency matrix given in [6,7].The following program computes the Adjacency matrix of above generalized graphs through MATLAB. Licensed Under Creative Commons Attribution CC BY for k=(j*n)+1:((j+1)*n) A(i,m+k)=1;A(m+k,i)=1; end j=j+1; end A;…”

Section: Definition 22:[2]mentioning

confidence: 99%

Wiener Index of Some Thorn Graphs

2015

IJSR

View full text Add to dashboard Cite

The Wiener index is one of the oldest molecular-graph-based structure-descriptors. The study of Wiener index is one of the current areas of research in mathematical chemistry. It also gives good correlations between Wiener index (of molecular graphs) and the physico chemical properties of the underlying organic compounds. That is, the Wiener index of a molecular graph provides a rough measure of the compactness of the underlying molecule. The Wiener index W(G) of a connected graph G is the sum of the distances between all pairs (ordered) of vertices of G. .A thorn graph G* can be generated from a parent graph G by attaching p new vertices to each vertex of G. The basic concepts of thorn graphs proposed by Gutman are extended to the wider concept of generalized thorny graphs. In this paper, WienerIndex of some classes of (generalized) thorn graphs like thorn paths, thorn cycle, thorn stars through MATLAB is presented.

show abstract

Section: Definition 22:[2]mentioning

confidence: 99%

Wiener Index of Some Thorn Graphs

2015

IJSR

View full text Add to dashboard Cite

show abstract

“…Note that if holds for all vertices , then . More generally, if is a constant function, say , then [6]. Let us introduce some notation.…”

Section: Introductionmentioning

confidence: 99%

Wiener Index of Interval Weighted Graphs

Nurkahlı

Büyükköse

2021

J. Sci. Arts

View full text Add to dashboard Cite

The Wiener index is classic and well-known topological index for the characterization of molecular graphs. In this paper, we study interval weighted graphs such as graphs where the edge weights are interval or interval matrices. In this study firstly we define interval weighted graph. Later we define Wiener index of interval weighted graph. From this definition, we give algorithms for finding Wiener index of interval weighted directed and undirected graph.

show abstract

Wiener Index of Directed and Weighted Graphs by MATLAB Program

Cited by 2 publications

References 7 publications

Wiener Index of Some Thorn Graphs

Wiener Index of Some Thorn Graphs

Wiener Index of Interval Weighted Graphs

Contact Info

Product

Resources

About