Chemical significance and degeneracy of weighted degree-based topological descriptor second Davan index for octane isomers and computation of certain nanostructures. [PDF]
Sci RepSwapna BS +4 more
europepmc +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons. [PDF]
Sci RepPunitha S, Kannan K, Menaga A.
europepmc +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
Fuzzy graph based machine learning optimization for permeable pavement systems in smart cities of Thoothukudi. [PDF]
Sci RepBenjamin A, Dharmakkan A.
europepmc +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
A lightweight cryptographic algorithm incorporating path coloring of cartesian product of graphs. [PDF]
Sci RepShivapriya P, Meera KN, Lin Y.
europepmc +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Machine learning approach to topological graph descriptors of graphene nanoribbons. [PDF]
Front ChemJyothish K +5 more
europepmc +1 more source
Exploring the Clinical Potential of Dynamic Digital Radiography: A Narrative Review
Journal of Medical Radiation Sciences, EarlyView.Dynamic Digital Radiography (DDR) is a promising X‐ray technology that captures rapid image sequences, enabling the visualisation of moving anatomical structures for various clinical applications, including pulmonary, cardiac and orthopaedic assessments.
Connor W. Braniff, Mohamed K. Badawy
wiley +1 more source