Results 51 to 60 of about 5,888,750 (277)
General Multiplicative Zagreb Indices of Graphs With Bridges
Multiplicative Zagreb indices have been studied due to their extensive applications. They play a substantial role in chemistry, pharmaceutical sciences, materials science and engineering, because we can correlate them with numerous physico-chemical ...
Monther Rashed Alfuraidan +3 more
doaj +1 more source
An extremal problem in graph theory [PDF]
G(n;l) will denote a graph of n vertices and l edges. Let f0(n, k) be the smallest integer such that there is a G (n;f0(n, k)) in which for every set of k vertices there is a vertex joined to each of these. Thus for example fo = 3 since in a triangle each pair of vertices is joined to a third.
Erdős, Pál, Moser, L.
openaire +1 more source
Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, Θ(n) chords are required.
Affif Chaouche Fatima +2 more
doaj +1 more source
Extremal graph theory via structural analysis [PDF]
We discuss two extremal problems in extremal graph theory. First we establish a precise characterisation of 4-uniform hypergraphs with minimum codegree close to n/2 which contain a Hamilton 2-cycle.
Garbe, Frederik
core +6 more sources
On the maximum orders of an induced forest, an induced tree, and a stable set [PDF]
Let G be a connected graph, n the order of G, and f (resp. t) the maximum order of an induced forest (resp. tree) in G. We show that f - t is at most n - 2√n-1. In the special case where n is of the form a2 + 1 for some even integer a ≥ 4, f -
Hertz Alain +2 more
doaj +1 more source
On bounds for topological descriptors of φ-sum graphs
The properties of chemical compounds are very important for the studies of the non-isomorphism phenomenon's related to the molecular graphs. Topological indices (TIs) are one of the mathematical tools which are used to study these properties.
Yu-Ming Chu +3 more
doaj +1 more source
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Maximal tree and unicylic graph for Euler Sombor index with given diameter
The study of topological descriptors is essential for understanding the underlying structures of graphs and networks. Numerous numerical descriptors associated with graphs have been used to analyze their overall structure.
Zahid Raza +3 more
doaj +1 more source
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
core +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source

