Results 41 to 50 of about 197 (156)
Generalized 4-connectivity of hierarchical star networks
Open Mathematics, 2022 The connectivity is an important measurement for the fault-tolerance of a network. The generalized connectivity is a natural generalization of the classical connectivity. An SS-tree of a connected graph GG is a tree T=(V′,E′)T=\left(V^{\prime} ,E^{\prime}
Wang Junzhen, Zou Jinyu, Zhang Shumin
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 6, Page 814-824, December 2025.Background: Gabapentin reportedly decreases central sensitisation, a disorder associated with chronic pruritus in humans, although this is not well documented in cats. Its combined use with the standard antipruritic therapy for feline atopic skin syndrome (FASS) is not yet described.
Jeanne Morency +10 more
wiley +1 more source
Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm [PDF]
, 2004 2000 Mathematics Subject Classification: 17A50, 05C05.In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x)
Gerritzen, L.
core
Domination Subdivision and Domination Multisubdivision Numbers of Graphs
Discussiones Mathematicae Graph Theory, 2019 The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for any tree
Dettlaff Magda +2 more
doaj +1 more source
Equating κ Maximum Degrees in Graphs without Short Cycles
Discussiones Mathematicae Graph Theory, 2020 For an integer k at least 2, and a graph G, let fk(G) be the minimum cardinality of a set X of vertices of G such that G − X has either k vertices of maximum degree or order less than k.
Fürst Maximilian +4 more
doaj +1 more source
The structure fault tolerance of burnt pancake networks
Open Mathematics, 2023 One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The HH-structure connectivity and HH-substructure connectivity extend the classical connectivity and are more practical.
Ge Huifen, Ye Chengfu, Zhang Shumin
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 6, Page 825-837, December 2025.Background: Inhibition of the Janus kinase pathway is an established treatment for allergic dermatitis. Objective: To evaluate the efficacy and safety of ilunocitinib for control of pruritus in dogs with allergic dermatitis in a randomised, double‐masked clinical trial.
Sophie Forster +5 more
wiley +1 more source
The Geometric-Arithmetic Index of Benzenoidsystems and Phenylenes. [PDF]
, 2010 The geometric-arithmetic index of graph G is defined as The GA index of benzenoid systems and phenylenes are computed, a simple relation is established between the geometric-arithmetic of a phenylene and the corresponding hexagonal squeeze in this paper.
Qiao Chen +3 more
core
Spanning paths and cycles in triangle-free graphs
, 2021 Let G bea triangle-free graph of order n and minimum degree δ > n/3. We will determine all lengths of cycles occurring in G. In particular, the length of a longest cycle or path in G is exactly the value admitted by the independence number of G.
Mushanyu, J., Mafuta, P.
core
Inverse Problem on the Steiner Wiener Index
Discussiones Mathematicae Graph Theory, 2018 The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source