Results 41 to 50 of about 157 (120)

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

Investigation of microbial contamination of commercial Romanowsky stain variant solutions used in veterinary clinics

Veterinary Dermatology, Volume 36, Issue 5, Page 613-620, October 2025.
Abstract Background Diff‐Quik (DQ) staining is widely used in clinical practice for its ease of use and rapid results. However, its potential contamination remains a concern. Hypothesis/Objectives This study aimed to investigate DQ solution contamination in veterinary hospitals and identify factors affecting it through a questionnaire on stain usage ...
Minji Cho, Seulgi Bae
wiley   +1 more source

Some remarks on the Dirichlet problem on infinite trees

Concrete Operators, 2019
We consider the Dirichlet problem on in_nite and locally _nite rooted trees, andwe prove that the set of irregular points for continuous data has zero capacity. We also give some uniqueness results for solutions in Sobolev W1,p of the tree.
Chalmoukis Nikolaos, Levi Matteo
doaj   +1 more source

Evaluation of filaggrin 2 expression in dogs with atopic dermatitis before and after oclacitinib maleate administration

Veterinary Dermatology, Volume 36, Issue 4, Page 453-461, August 2025.
Background – Canine atopic dermatitis (cAD) is a chronic, inflammatory, multifactorial and pruritic disease. The presence of skin barrier impairment (e.g. filaggrin alterations), along with abnormal immune responses, can negatively impact cutaneous barrier function.
Wendie Roldan Villalobos, Tássia Ferreira, Fernanda Borek, Domenico Santoro, Lluis Ferrer, Marconi Farias   +5 more
wiley   +1 more source

The Minimum Size of a Graph with Given Tree Connectivity

Discussiones Mathematicae Graph Theory, 2021
For a graph G = (V, E) and a set S ⊆ V of at least two vertices, an S-tree is a such subgraph T of G that is a tree with S ⊆ V (T). Two S-trees T1 and T2 are said to be internally disjoint if E(T1) ∩ E(T2) = ∅ and V (T1) ∩ V (T2) = S, and edge-disjoint ...
Sun Yuefang, Sheng Bin, Jin Zemin
doaj   +1 more source

Harmonic‐Arithmetic Index: Lower Bound for n‐Order Trees With Fixed Number of Pendant Vertices and Monogenic Semigroup for Graph Operations

International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.
Graph theory combined with chemistry provides a strong framework for modeling and assessing chemical compounds. By representing molecules as graphs and applying topological indices, chemists can gain profound insights into the physical and chemical characteristics of compounds.
Kalpana R., Shobana L., Vladimir Mityushev   +2 more
wiley   +1 more source

On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees

Journal of Mathematics, Volume 2025, Issue 1, 2025.
Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif, Akhlaq A. Bhatti, Hicham Saber, Adel A. Attiya, Akbar Ali, Guo Zhong   +5 more
wiley   +1 more source

Further results on permanents of Laplacian matrices of trees

Open Mathematics
The research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj   +1 more source

On the Multiplicative Sum Zagreb Index of Molecular Trees With Given Order and Number of Branching Vertices

Journal of Mathematics, Volume 2025, Issue 1, 2025.
The multiplicative sum Zagreb index of a graph G is defined as the product of the sum of the degrees of adjacent vertices of G. A molecular tree is an acyclic connected graph with maximum degree at most 4. A vertex in a molecular tree with degree 3 or 4 is referred to as a branching vertex. In this paper, we consider the class of all molecular trees of
Sadia Noureen, Mubashar Abbas, Abdulaziz Mutlaq Alotaibi, Jaya Percival Mazorodze, Taher S. Hassan, Akbar Ali, Zafar Ullah   +6 more
wiley   +1 more source

A Constructive Characterization of Vertex Cover Roman Trees

Discussiones Mathematicae Graph Theory, 2021
A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera, Kuziak Dorota, Yero Ismael G.   +2 more
doaj   +1 more source