Results 11 to 20 of about 238 (93)
Veterinary Dermatology, Volume 34, Issue 3, Page 235-245, June 2023., 2023 Background – Oral and parenteral drug delivery in horses can be difficult. Equine‐specific transdermal drug formulations offer improved ease of treatment; development of such formulations requires a deeper understanding of the structural and chemical tissue barrier of horse skin. Hypothesis/Objectives – To compare the structural composition and barrier
Samuel C. Bizley +3 more
wiley +1 more source
The extremal number of longer subdivisions
Bulletin of the London Mathematical Society, Volume 53, Issue 1, Page 108-118, February 2021., 2021 Abstract For a multigraph F, the k‐subdivision of F is the graph obtained by replacing the edges of F with pairwise internally vertex‐disjoint paths of length k+1. Conlon and Lee conjectured that if k is even, then the (k−1)‐subdivision of any multigraph has extremal number O(n1+1k), and moreover, that for any simple graph F there exists ε>0 such that ...
Oliver Janzer
wiley +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika, Volume 66, Issue 2, Page 422-447, April 2020., 2020 Abstract We study the model Gα∪G(n,p) of randomly perturbed dense graphs, where Gα is any n‐vertex graph with minimum degree at least αn and G(n,p) is the binomial random graph. We introduce a general approach for studying the appearance of spanning subgraphs in this model using absorption.
Julia Böttcher +3 more
wiley +1 more source
Comparing Eccentricity-Based Graph Invariants
Discussiones Mathematicae Graph Theory, 2020 The first and second Zagreb eccentricity indices (EM1 and EM2), the eccentric distance sum (EDS), and the connective eccentricity index (CEI) are all recently conceived eccentricity-based graph invariants, some of which found applications in chemistry ...
Hua Hongbo, Wang Hongzhuan, Gutman Ivan
doaj +1 more source
A Note on Packing of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies ...
Konarski Jerzy +2 more
doaj +1 more source
Zagreb Polynomials and Redefined Zagreb indices for the Line Graph of Carbon Nanocones
Open Journal of Mathematical Analysis, 2018 A line graph has many useful applications in physical chemistry. Topological indices are numerical parameters associated to a structure and, in combination, determine properties of the concerned material.
Saba Noreen, Atif Mahmood
semanticscholar +1 more source
Stability for the Erdős-Rothschild problem
Forum of Mathematics, Sigma, 2023 Given a sequence $\boldsymbol {k} := (k_1,\ldots ,k_s)$ of natural numbers and a graph G, let $F(G;\boldsymbol {k})$ denote the number of colourings of the edges of G with colours $1,\dots ,s$ , such that, for every $c \in \{1 ...
Oleg Pikhurko, Katherine Staden
doaj +1 more source
EXTREMAL HYPER ZAGREB INDEX FOR TRICYCLIC GRAPHS
, 2020 For a graph G = (V (G), E(G)), the first hyper Zagreb index is defined as ∑ uv∈E(G)(d(u) + d(v)) 2, where d(v) is the degree of the vertex v. The hyper Zagreb index is a kind of extensions of Zagreb index.
Zheng-Qing Chu, M. Jamil, Aisha Javed
semanticscholar +1 more source
Extremal problems of double stars [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 In a generalized Tur\'an problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$-free graph of order $n$. In this paper, we study the number of double stars $S_{k,l}$ in triangle-free graphs.
Ervin Győri +2 more
doaj +1 more source