Results 11 to 20 of about 1,202 (110)
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
On concentrators and related approximation constants [PDF]
, 2013 Pippenger ([Pippenger, 1977]) showed the existence of $(6m,4m,3m,6)$-concentrator for each positive integer $m$ using a probabilistic method. We generalize his approach and prove existence of $(6m,4m,3m,5.05)$-concentrator (which is no longer regular ...
Bondarenko, A. +2 more
core +6 more sources
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 proof of the stability of extremal graphs, Simonovits' stability from Szemer\'edi's regularity [PDF]
, 2015 The following sharpening of Tur\'an's theorem is proved. Let $T_{n,p}$ denote the complete $p$--partite graph of order $n$ having the maximum number of edges. If $G$ is an $n$-vertex $K_{p+1}$-free graph with $e(T_{n,p})-t$ edges then there exists an (at
Füredi, Zoltán
core +2 more sources
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
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
EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS
, 2020 Graph embedding is the mapping of a topological structure (guest graph) into another topological structure (host graph) that preserves certain required topological properties and the graph embedding ability reflects how efficiently a parallel algorithm ...
Jiangxia Liu, R. Karthik, S. R. Kumar
semanticscholar +1 more source