Results 161 to 170 of about 1,340 (226)

On the Wiener Polarity Index of Lattice Networks. [PDF]

open access: yesPLoS One, 2016
Chen L, Li T, Liu J, Shi Y, Wang H.
europepmc   +1 more source

Counting $s$-Catalan words according to total variation

open access: yesEnumerative Combinatorics and Applications
Sela Fried, Mark Shattuck
doaj   +1 more source

On Wiener index and Wiener polarity index of some polyomino chains

open access: yesJournal of Discrete Mathematical Sciences and Cryptography, 2019
A graph invariant is a numerical value that depicts the structural properties of an entire graph. The Wiener index is the oldest distance based graph invariant which is defined as the sum of distances between all unordered pair of vertices of the graph G.
Sarfraz Ahmad   +2 more
exaly   +3 more sources

Transformation of a cellular skyrmion to polyomino-like structures

open access: yesApplied Physics Letters
Topological spin structures with transformable shapes may have potential implications for data storage and computation. Here, we demonstrate that a square cellular skyrmion on an artificial grid pinning pattern can be manipulated by programmed current ...
J. Xia   +5 more
semanticscholar   +3 more sources

3D polyomino puzzle

open access: yesACM Transactions on Graphics, 2009
This paper presents a computer-aided geometric design approach to realize a new genre of 3D puzzle, namely the 3D Polyomino puzzle. We base our puzzle pieces on the family of 2D shapes known as polyominoes in recreational mathematics, and construct the ...
Chi-Wing Fu, Fuchi-Wing
exaly   +2 more sources

The PI Index of polyomino chains

open access: yesApplied Mathematics Letters, 2008
The PI index is a graph invariant defined as the summation of the sums of neu(e|G) and nev(e|G) over all the edges e=uv of a connected graph G, i.e., PI(G)=∑e∈E(G)[neu(e|G)+nev(e|G)], where neu(e|G) is the number of edges of G lying closer to u than to v
Shubo Chen
exaly   +2 more sources

Home - About - Disclaimer - Privacy