Results 71 to 80 of about 199,356 (251)
Metric Dimension of Amalgamation of Graphs [PDF]
, 2013 A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.
Saputro, Suhadi Wido +2 more
core
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Advanced Materials, EarlyView.Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source
“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis
The Scientific World Journal, 2013 Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods.
Qin Wu +3 more
doaj +1 more source
-labeling of supersubdivided connected graph plus an edge
AKCE International Journal of Graphs and Combinatorics, 2020 Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source
Distance Preserving Graph Simplification
, 2011 Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce "gate graph" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph.
Huang, Yan, Jin, Ruoming, Ruan, Ning
core +1 more source
Advanced Materials, EarlyView.This study explores how alkoxy side chains influence COF properties to enhance oxygen reduction reaction (ORR) performance. Incorporating varying alkoxy groups improves hydrophilicity and modulates the electronic structure via p‐π conjugation. Notably, longer alkoxy side chains facilitate fine‐tuning of the COFs' electronic states, resulting in ...
Zhongping Li +12 more
wiley +1 more source
The Reformulated F-Index of Vertex and Edge F-Join of Graphs
Journal of Chemistry, 2022 The valency based topological indices (TIs) are defined by algebraic functions as the chemical graph theory tools in which the structural parameters are used as input and the output is related with the topology of chemical species.
Durbar Maji +2 more
doaj +1 more source
Parameterizing edge modification problems above lower bounds
, 2016 We study the parameterized complexity of a variant of the $F$-free Editing problem: Given a graph $G$ and a natural number $k$, is it possible to modify at most $k$ edges in $G$ so that the resulting graph contains no induced subgraph isomorphic to $F ...
Froese, Vincent +2 more
core +1 more source
AI‐Driven Defect Engineering for Advanced Thermoelectric Materials
Advanced Materials, EarlyView.This review presents how AI accelerates the design of defect‐tuned thermoelectric materials. By integrating machine learning with high‐throughput data and physics‐informed representations, it enables efficient prediction of thermoelectric performance from complex defect landscapes.
Chu‐Liang Fu +9 more
wiley +1 more source
Random graphs with arbitrary degree distributions and their applications
, 2001 Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past.
A. Broder +46 more
core +1 more source