Results 181 to 190 of about 110,794 (282)

A novel computational study of reverse degree topological indices and entropies for nanostar dendrimers. [PDF]

Sci Rep
Qummer AA, Saqib M, Ali S, Ashebo MA, Jumaniyazov S.   +4 more
europepmc   +1 more source

An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth

Journal of Graph Theory, EarlyView.
ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth.
Marc Distel
wiley   +1 more source

Topological data analysis and topological deep learning beyond persistent homology: a review. [PDF]

Artif Intell Rev
Su Z, Liu X, Hamdan LB, Maroulas V, Wu J, Carlsson G, Wei GW, Wei GW.   +7 more
europepmc   +1 more source

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Parameter identifiability of linear-compartmental mammillary models. [PDF]

Bull Math Biol
Clemens K, Martinez J, Shiu A, Thompson M, Warren B.   +4 more
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Large dynamic range Shack-Hartmann wavefront sensing based on a graph-theoretic computational model. [PDF]

Light Sci Appl
Du L, Xu R, Liu S, Shao R, Li L, Zhang Y, Li Z, Qu Y, Tian D, Yang J.   +9 more
europepmc   +1 more source

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, EarlyView.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

An Optimized Pedestrian Inertial Navigation Method Based on the Birkhoff Pseudospectral Method. [PDF]

Sensors (Basel)
Zhang Z, Zhao D, Tian D.
europepmc   +1 more source