Results 31 to 40 of about 742 (250)
An extremal problem in graph theory [PDF]
Journal of the Australian Mathematical Society, 1970 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
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Discussiones Mathematicae Graph Theory, 2014 Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to ...
Nakamigawa Tomoki
doaj +1 more source
General Multiplicative Zagreb Indices of Graphs With Bridges
IEEE Access, 2020 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
Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords
Discussiones Mathematicae Graph Theory, 2015 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
On the maximum orders of an induced forest, an induced tree, and a stable set [PDF]
Yugoslav Journal of Operations Research, 2014 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
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Maximal tree and unicylic graph for Euler Sombor index with given diameter
AKCE International Journal of Graphs and CombinatoricsThe 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
On bounds for topological descriptors of φ-sum graphs
Journal of Taibah University for Science, 2020 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
Molecular Oncology, EarlyView.Interferon type 1 (IFN‐1) production and signaling is associated with the acquisition of therapy resistance, following chronic DNA damage, via Interferon‐related DNA damage resistance signature (IRDS) gene expression. An alternative, DNA damage‐independent role of sustained IFN‐1 mediated resistance was identified and characterized by the emergence of ...
Ashlyn Conant +11 more
wiley +1 more source
Extremal Topological Indices with Prescribed Degree Sequences
Vestnik KRAUNC: Fiziko-Matematičeskie NaukiThis paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj +1 more source