Results 61 to 70 of about 197 (156)

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

open access: yesJournal 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

A Constructive Characterization of Vertex Cover Roman Trees

open access: yesDiscussiones 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   +2 more
doaj   +1 more source

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

open access: yesJournal 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   +6 more
wiley   +1 more source

Parsimonious cluster systems

open access: yes
Overlapping clustering, Parsimony, Phylogenetic trees, Dissimilarities, 05C65, 05C05, 03G10,
Alain Gély, François Brucker
core   +1 more source

On Double-Star Decomposition of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence (k1 + 1, k2 + 1, 1, . . . , 1) is denoted by Sk1,k2. We study the edge-decomposition of graphs into double-stars.
Akbari Saieed   +3 more
doaj   +1 more source

Independent Transversal Total Domination Versus Total Domination in Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2021
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera   +2 more
doaj   +1 more source

Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter

open access: yesJournal of Mathematics, Volume 2025, Issue 1, 2025.
For a connected graph G and two real numbers a, b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where V(G) represent the vertex set of graph G, dG(v) denotes the degree of vertex v, and ecG(v) is the eccentricity of v in G, that is, the maximum distance from v to another vertex of G. This index generalizes several well‐
Mesfin Masre, G. Muhiuddin
wiley   +1 more source

Gaps in the Saturation Spectrum of Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum ...
Horn Paul   +3 more
doaj   +1 more source

Analysis of the immunomodulatory properties of mycobacterium cell wall fraction on the cytokine production of peripheral blood mononuclear cells of healthy dogs

open access: yesVeterinary Dermatology, Volume 35, Issue 6, Page 595-604, December 2024.
Background – Mycobacterium cell wall fraction (MCWF) is derived from nonpathogenic Mycobacterium phlei and is used as an immunomodulatory compound in clinical practice, yet its mode‐of‐action requires further research. Objective – To evaluate the host response to MCWF in canine peripheral blood mononuclear cells (PBMCs) by using enzyme‐linked ...
Robert Ward   +9 more
wiley   +1 more source

Packing Coloring of Some Undirected and Oriented Coronae Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy