Results 241 to 250 of about 6,027,070 (293)
Some of the next articles are maybe not open access.
Bounds for the co-PI index of a graph
2015In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
Kaya, E., Maden, A. D.
openaire +3 more sources
The PI Index of Polyomino Chains of 4k-Cycles
Acta Applicandae Mathematicae, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mansour, Toufik, Schork, Matthias
openaire +2 more sources
Weighted PI index of tensor product and strong product of graphs
Discret. Math. Algorithms Appl., 2020The Weighted Padmakar–Ivan (PI) index of a connected, simple graph [Formula: see text] is given by [Formula: see text], where [Formula: see text] denotes the number of equidistant vertices of the edge [Formula: see text]. In this paper, weighted PI index
C. Gopika, J. Geetha, K. Somasundaram
semanticscholar +1 more source
2023
Summary: The PI index of a graph \(G\) is given by \(\operatorname{PI}(G)=\sum_{e\in E(G)} (|V(G)|-N_G(e))\), where \(N_G(e)\) is the number of equidistant vertices for the edge \(e\). Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs.
SC, Manju, K, Somasundaram
openaire +2 more sources
Summary: The PI index of a graph \(G\) is given by \(\operatorname{PI}(G)=\sum_{e\in E(G)} (|V(G)|-N_G(e))\), where \(N_G(e)\) is the number of equidistant vertices for the edge \(e\). Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs.
SC, Manju, K, Somasundaram
openaire +2 more sources
The weighted vertex PI index of (n, m)-graphs with given diameter
Applied Mathematics and Computation, 2019The weighted vertex PI index of a graph G is defined by P I w ( G ) = ∑ e = u v ∈ E ( G ) ( d G ( u ) + d G ( v ) ) ( n u ( e | G ) + n v ( e | G ) ) where nu(e|G) denotes the number of vertices in G whose distance to the vertex u is smaller than the ...
Gang Ma, Qiuju Bian, Jianfeng Wang
semanticscholar +1 more source
The maximum PI index of bicyclic graphs with even number of edges
Information Processing Letters, 2019The PI index of a graph G is defined by P I ( G ) = ∑ e = ( u , v ) ∈ E [ m u ( e | G ) + m v ( e | G ) ] where m u ( e | G ) be the number of edges in G lying closer to the vertex u than to the vertex v.
Gang Ma, Qiuju Bian, Jianfeng Wang
semanticscholar +1 more source
PI Index of V-Phenylenic Nanotubes and Nanotori
Journal of Computational and Theoretical Nanoscience, 2007H. Yousefi +3 more
openaire +2 more sources
The weighted vertex PI index of tricyclic graphs
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gang Ma, Qiuju Bian, Jianfeng Wang
openaire +1 more source
1989
The ponderal index (PI) is height divided by cube root of weight. The lower the PI, the more obese the individual. This index is a better indicator of obesity than height and weight alone. If the PI is less than 11, there is increased operative risk compared with patients having a larger PI.
openaire +1 more source
The ponderal index (PI) is height divided by cube root of weight. The lower the PI, the more obese the individual. This index is a better indicator of obesity than height and weight alone. If the PI is less than 11, there is increased operative risk compared with patients having a larger PI.
openaire +1 more source
PI Index of Mesh Structured Chemicals
2011The PI index of a graph G is defined as PI(G) = Σ[η eu(e|G) + η ev(e|G), where for the edge e = (u,v), η eu(e|G) is the number of edges of G lying closer to u than v; η ev(e|G) is the number of edges of G lying closer to v than u and summation goes over all edges of G.
S. Little Joice +3 more
openaire +1 more source