Graph Theory and Molecular Behavior: Utilizing Platt Numbers and Polynomial Approximations for Boiling Point Estimations

ABSTRACT Analyzing complex multivalued datasets, such as boiling points and molecular Platt numbers, poses significant challenges due to the intricate relationships within the data, which traditional methods struggle to capture effectively. To address this, the study introduces Edge Neighborhood Graphs Ne(G), a novel graph‐based approach where the neighborhoods of edges in a graph G = (V, E) are treated as vertices, and an edge is drawn between two vertices if their corresponding neighborhoods intersect. This method is explored using complete, cycle, and wheel graphs, with formulas derived for vertex degrees in Ne(G) to uncover structural patterns. Polynomial approximations are employed to apply Ne(G) to multivalued data, demonstrating its effectiveness in modeling complex relationships and providing accurate predictions. By offering a powerful new tool for analyzing intricate datasets, this study makes a unique contribution to graph theory and data modeling, with promising potential for application to other graph types and diverse datasets in the future.

Authors

Institutions

Publication Details

Journal
Engineering Reports
Published
2025-02-01
DOI
https://doi.org/10.1002/eng2.13124
Citations
1
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
4.09
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph Theory and Molecular Behavior: Utilizing Platt Numbers and Polynomial Approximations for Boiling Point Estimations

S G Sarika, R Manjusha
1 citations
Engineering Reports
Graph theory and applications
4.09
article

Graph Theory and Molecular Behavior: Utilizing Platt Numbers and Polynomial Approximations for Boiling Point Estimations

S G Sarika, R Manjusha
article en
1 citations

Abstract

ABSTRACT Analyzing complex multivalued datasets, such as boiling points and molecular Platt numbers, poses significant challenges due to the intricate relationships within the data, which traditional methods struggle to capture effectively. To address this, the study introduces Edge Neighborhood Graphs Ne(G), a novel graph‐based approach where the neighborhoods of edges in a graph G = (V, E) are treated as vertices, and an edge is drawn between two vertices if their corresponding neighborhoods intersect. This method is explored using complete, cycle, and wheel graphs, with formulas derived for vertex degrees in Ne(G) to uncover structural patterns. Polynomial approximations are employed to apply Ne(G) to multivalued data, demonstrating its effectiveness in modeling complex relationships and providing accurate predictions. By offering a powerful new tool for analyzing intricate datasets, this study makes a unique contribution to graph theory and data modeling, with promising potential for application to other graph types and diverse datasets in the future.

Engineering ReportsVol. 7(2)
Amrita Vishwa Vidyapeetham (IN)
Openalex Percentile: Top 12%
Graph theory and applications
4.09
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.