Verification of Some Topological Indices of Y-Junction Based Nanostructures by M-Polynomials

Azeem, Muhammad; Jamil, Muhammad Kamran; Javed, Aisha; Ahmad, Ali

doi:10.1155/2022/8238651

Cited by 33 publications

(10 citation statements)

References 29 publications

(27 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is simple to see as numeric values for a complex structure. Additionally, we checked the results from the literature on the topological index using the vertex-based indices technique . We examine the quantitative measure of distance and degree-based indices in Figures and .…”

Section: Discussionmentioning

confidence: 99%

A Study on Efficient Technique for Generating Vertex-based Topological Characterization of Boric Acid 2D Structure

Jeyaraj,

Santiago

2023

ACS Omega

View full text Add to dashboard Cite

The computational technique called the cut method is used to predict the natural behaviors among the chemical network's physicochemical characteristics, known as topological indices. Distance-based indices are used to describe the physical density of chemical networks. In this paper, we have done analytical computation results for the vertex-distance-based and vertex-degree-based indices for boric acid hydrogen-bonded 2D lattice sheet. Boric acid is an inorganic compound with low toxicity when applied to the skin or eaten. A graphical representation is used to explain a thorough comparison of the computed topological indices of hydrogen-bonded 2D lattice sheets of boric acid.

show abstract

Section: Discussionmentioning

confidence: 99%

A Study on Efficient Technique for Generating Vertex-based Topological Characterization of Boric Acid 2D Structure

Jeyaraj,

Santiago

2023

ACS Omega

View full text Add to dashboard Cite

show abstract

“…They also came up with an exact solution for the parallel composition of pathways of various lengths. Some updated references are (Ahmad et al, 2021;Ali et al, 2021;Azeem et al, 2021Azeem et al, , 2022Shanmukha et al, 2022a,b,c;Usha et al, 2022).…”

Section: Figurementioning

confidence: 99%

Computing the partition dimension of certain families of Toeplitz graph

Luo

Khalil²,

Ahmad

et al. 2022

Front. Comput. Neurosci.

View full text Add to dashboard Cite

Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path between them. A k-ordered partition of vertices is defined as β = {β1, β2, …, βk}. If all distances d(v, βk) are finite for all vertices v ∈ V, then the k-tuple (d(v, β1), d(v, β2), …, d(v, βk)) represents vertex v in terms of β, and is represented by r(v|β). If every vertex has a different presentation, the k-partition β is a resolving partition. The partition dimension of G, indicated by pd(G), is the minimal k for which there is a resolving k-partition of V(G). The partition dimension of Toeplitz graphs formed by two and three generators is constant, as shown in the following paper. The resolving set allows obtaining a unique representation for computer structures. In particular, they are used in pharmaceutical research for discovering patterns common to a variety of drugs. The above definitions are based on the hypothesis of chemical graph theory and it is a customary depiction of chemical compounds in form of graph structures, where the node and edge represent the atom and bond types, respectively.

show abstract

“…The graphs are pairs of sets of nodes and edges, where nodes represent objects and edges represent relations between pairs of nodes. The flexibility of the data structure enables the wide use of graphs in a wide range of applications, from solving universal network-related problems [ 2 , 3 , 4 ] to molecular structure analysis [ 5 ] and machine learning models [ 6 ]. A special type of graph, containing semantic relations between the entities is known as a knowledge graph [ 7 ].…”

Section: Introductionmentioning

confidence: 99%

BioGraph: Data Model for Linking and Querying Diverse Biological Metadata

Veljković

Orlov

Mitić

2023

IJMS

View full text Add to dashboard Cite

Studying the association of gene function, diseases, and regulatory gene network reconstruction demands data compatibility. Data from different databases follow distinct schemas and are accessible in heterogenic ways. Although the experiments differ, data may still be related to the same biological entities. Some entities may not be strictly biological, such as geolocations of habitats or paper references, but they provide a broader context for other entities. The same entities from different datasets can share similar properties, which may or may not be found within other datasets. Joint, simultaneous data fetching from multiple data sources is complicated for the end-user or, in many cases, unsupported and inefficient due to differences in data structures and ways of accessing the data. We propose BioGraph—a new model that enables connecting and retrieving information from the linked biological data that originated from diverse datasets. We have tested the model on metadata collected from five diverse public datasets and successfully constructed a knowledge graph containing more than 17 million model objects, of which 2.5 million are individual biological entity objects. The model enables the selection of complex patterns and retrieval of matched results that can be discovered only by joining the data from multiple sources.

show abstract

Verification of Some Topological Indices of Y-Junction Based Nanostructures by M-Polynomials

Cited by 33 publications

References 29 publications

A Study on Efficient Technique for Generating Vertex-based Topological Characterization of Boric Acid 2D Structure

A Study on Efficient Technique for Generating Vertex-based Topological Characterization of Boric Acid 2D Structure

Computing the partition dimension of certain families of Toeplitz graph

BioGraph: Data Model for Linking and Querying Diverse Biological Metadata

Contact Info

Product

Resources

About