Results 191 to 200 of about 207,710 (268)

QSAR analysis of drugs using graph based degree based topological indices and regression models. [PDF]

Sci Rep
Mufti ZS, Kabeer A, Almehizia AA, Ganati GA.   +3 more
europepmc   +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

Isoscattering non-isospectral quantum graphs. [PDF]

Sci Rep
Farooq O, Ławniczak M, Kurasov P, Sirko L.   +3 more
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

A constructive method to determine the total vertex irregularity strength of two flower graph variants. [PDF]

MethodsX
Hinding N, Sunusi N, Mutmainnah S, Rahayu II, Sy S, Sugeng KA, Simanjuntak RG.   +6 more
europepmc   +1 more source

On Tight Tree‐Complete Hypergraph Ramsey Numbers

Journal of Graph Theory, EarlyView.
ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley   +1 more source

Evolution Equations on Co-evolving Graphs: Long-Time Behaviour and the Graph-Continuity Equation. [PDF]

J Nonlinear Sci
Carrillo JA, Esposito A, Mikolás L.
europepmc   +1 more source

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Infinitesimal homeostasis in mass-action systems. [PDF]

J Math Biol
Jin J, Rempala GA.
europepmc   +1 more source

Hitting Times in the Binomial Random Graph

Journal of Graph Theory, EarlyView.
ABSTRACT Fix k ≥ 2 $k\ge 2$, choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) $\frac{\mathrm{log}n}{{n}^{(k-1)\unicode{x02215}k}}\le p\le 1-{\rm{\Omega }}(\frac{{\mathrm{log}}^{4}n}{n})$, and consider G ~ G ( n , p ) $G\unicode{x0007E}G(n,p)$. For any pair of vertices v , w ∈ V ( G ) $v,w\in V(G)$, we give a simple and precise formula for the ...
Bertille Granet, Felix Joos, Jonathan Schrodt   +2 more
wiley   +1 more source