Results 61 to 70 of about 193 (154)
The Eccentric Connectivity Index of Dendrimers [PDF]
, 2010 If G is a connected graph with vertex set V , then the eccentric connectivity index of G, ξ C (G), is defined as is the degree of a vertex v and ecc(v) is its eccentricity.
Jianguang Yang, Fangli Xia
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
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
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 +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
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
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. +2 more
wiley +1 more source
The Modified Schultz Index of Trees [PDF]
, 2010 For a graph G = (V, E), the modified Schultz index of G is defined as the degree of the vertex u of G, and d G (u, v) is the distance between u and v.
Shubo Chen, Weijun Liu
core
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 +5 more
wiley +1 more source
GA2 index of some graph operations
, 2010 Let G = (V, E) be a graph. For e = uv ? E(G), nu (e) is the number of vertices of G lying closer to u than to v and nv (e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ?uv?E(G) 2?
G.H. Fath-Tabar +2 more
core +1 more source