Results 11 to 20 of about 1,105 (94)
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
Veterinary Dermatology, Volume 32, Issue 6, Page 668-e178, December 2021., 2021 Background Antimicrobial resistance in Staphylococcus pseudintermedius (SP) and the prevalence of meticillin‐resistant SP (MRSP) is increasing in dogs worldwide. Objectives To evaluate the influence of hospital size on antimicrobial resistance of SP and whether restricted use of antimicrobials based on antibiograms could reduce the identification of ...
Keita Iyori +5 more
wiley +1 more source
The Forcing Weak Edge Detour Number of a Graph [PDF]
, 2010 The forcing weak edge detour numbers of certain classes of graphs are ...
Athisayanathan, S., Santhakumaran, A.P.
core +1 more source
Functional centrality in graphs [PDF]
, 2006 In this paper we introduce the functional centrality as a generalization of the subgraph centrality. We propose a general method for characterizing nodes in the graph according to the number of closed walks starting and ending at the node.
A. Gutiérrez +5 more
core +2 more sources
Some improved bounds on two energy-like invariants of some derived graphs
Open Mathematics, 2019 Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
Dualizing Distance-Hereditary Graphs
Discussiones Mathematicae Graph Theory, 2021 Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj +1 more source
Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics [PDF]
, 2009 There exist finite universal immersion spaces for the following: (a) Edge-colored graphs of bounded degree and boundedly many colors.
Bartal, Yair, Schulman, Leonard J.
core +1 more source
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
Discussiones Mathematicae Graph Theory, 2021 Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the sense that the edges have pairwise different tuples of distances to the vertices of S.
Zubrilina Nina
doaj +1 more source
Hosoya properties of the commuting graph associated with the group of symmetries
Main Group Metal Chemistry, 2021 A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam +4 more
doaj +1 more source
The Armendariz Graph of a Ring
Discussiones Mathematicae - General Algebra and Applications, 2018 In this paper we initiate the study of Armendariz graph of a commutative ring R and investigate the basic properties of this graph such as diameter, girth, domination number, etc.
Abdioğlu Cihat +2 more
doaj +1 more source