Results 21 to 30 of about 193 (154)
Veterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022 Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro +3 more
wiley +1 more source
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
Connectedness of a suborbital graph for congruence subgroups [PDF]
, 2013 In this paper, we give necessary and sufficient conditions for the graph to be connected and a forest.
Yavuz Kesicioğlu +5 more
core +1 more source
Lazy tournaments and multidegrees of a projective embedding of \(\overline{M}_{0,n}\) [PDF]
, 2023 We consider the (iterated) Kapranov embedding \(\Omega_n:\overline{M}_{0,n+3} \hookrightarrow \mathbb{P}^1 \times \cdots \times \mathbb{P}^n\), where \(\overline{M}_{0,n+3}\) is the moduli space of stable genus \(0\) curves with \(n+3\) marked points. In
Levinson, Jake +2 more
core +1 more source
The multiplicative Zagreb indices of graph operations [PDF]
, 2013 Recently, Todeschini et al. (Novel Molecular Structure Descriptors - Theory and Applications I, pp. 73-100, 2010), Todeschini and Consonni (MATCH Commun. Math. Comput. Chem.
Das, Kinkar C., Çevik, Ahmet Sinan
core +2 more sources
Saturation Spectrum of Paths and Stars
Discussiones Mathematicae Graph Theory, 2017 A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from G̅ to G results in a copy of H. The minimum size of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number,
Faudree Jill +4 more
doaj +1 more source
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2018 In the paper, we show that the incidence chromatic number χi of a complete k-partite graph is at most Δ + 2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to Δ + 1 if and only if the smallest part has only one vertex ...
Janczewski Robert +2 more
doaj +1 more source
On death processes and urn models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's problem, originally introduced by Knuth and McCarthy, and generalizations
Markus Kuba, Alois Panholzer
doaj +1 more source
Banhatti, revan and hyper-indices of silicon carbide Si2C3-III[n,m]
Open Chemistry, 2021 In recent years, several structure-based properties of the molecular graphs are understood through the chemical graph theory. The molecular graph GG of a molecule consists of vertices and edges, where vertices represent the atoms in a molecule and edges ...
Zhao Dongming +6 more
doaj +1 more source
The Arithmetic Tutte polynomial of two matrices associated to Trees
Special Matrices, 2018 Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the arithmetic Tutte polynomial MA(x, y) of A is a fundamental invariant with deep connections to several areas. In this work, we consider two lists of vectors
Bapat R. B. +1 more
doaj +1 more source