Results 231 to 240 of about 249,936 (334)

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

Explicit minimisers for anisotropic Riesz energies. [PDF]

Calc Var Partial Differ Equ
Frank RL, Mateu J, Mora MG, Rondi L, Scardia L, Verdera J.   +5 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

A Lyapunov-Based Analysis on the Almost Periodicity of Impulsive Conformable Reaction-Diffusion Neural Networks with Distributed Delays. [PDF]

Entropy (Basel)
Stamova I, Stamov G, Spirova C.
europepmc   +1 more source

Trapped surfaces in spacetimes with symmetries and applications to uniqueness theorems

, 2011
Alberto Carrasco Ferreira
openalex   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Dynamic stability analysis of a fractional calculus-based colon cancer model with therapeutic interventions. [PDF]

Sci Rep
Tai R, Chen Z, Zhao Y, Shi R.
europepmc   +1 more source

Halin's Grid Theorem for Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ ${\rm{ {\mathcal R} }}$ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ ${\rm{ {\mathcal R} }}$.
Florian Reich
wiley   +1 more source

Artificial neural network analysis of a fractional cyber-epidemic model in wireless sensors under the proportional Hadamard-Caputo operator. [PDF]

Sci Rep
Barakat MA, Hyder AA, Aboelenen T, Iqbal N, Shafee A, Noori N.   +5 more
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á, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source