Analyzing lattice networks through substructures

Analyzing lattice networks through substructures Analyzing the topology of network structures is an important topic studied from many different aspects of science and mathematics. The Wiener polarity index (number of unordered pairs of vertices at distance 3 from each other) is one of the representative descriptors of graph structures. It was computed for several lattice networks by Chen et al. [11] in an effort to understand the properties of these networks. The Wiener polarity index is a variation of the classic distance-based graph invariant, the Wiener index (sum of distances between all pairs of vertices), which is known to be closely related to the number of substructures. In this paper we examine the numbers of various subgraphs of order 4 for these lattice networks. In addition to confirming their symmetric nature, comparing the numbers of various substructures leads to insights on other less trivial characteristics of these network structures of common interest. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Computation Elsevier

Analyzing lattice networks through substructures

Loading next page...
 
/lp/elsevier/analyzing-lattice-networks-through-substructures-jH0trNnQgk
Publisher
Elsevier
Copyright
Copyright © 2018 Elsevier Inc.
ISSN
0096-3003
eISSN
1873-5649
D.O.I.
10.1016/j.amc.2018.02.012
Publisher site
See Article on Publisher Site

Abstract

Analyzing the topology of network structures is an important topic studied from many different aspects of science and mathematics. The Wiener polarity index (number of unordered pairs of vertices at distance 3 from each other) is one of the representative descriptors of graph structures. It was computed for several lattice networks by Chen et al. [11] in an effort to understand the properties of these networks. The Wiener polarity index is a variation of the classic distance-based graph invariant, the Wiener index (sum of distances between all pairs of vertices), which is known to be closely related to the number of substructures. In this paper we examine the numbers of various subgraphs of order 4 for these lattice networks. In addition to confirming their symmetric nature, comparing the numbers of various substructures leads to insights on other less trivial characteristics of these network structures of common interest.

Journal

Applied Mathematics and ComputationElsevier

Published: Jul 15, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off