Results 31 to 40 of about 34,690 (269)
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
, 2014 Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs.
Krivelevich, Michael
core +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
Tur\'an Graphs, Stability Number, and Fibonacci Index
, 2008 The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and ...
A. Knopfmacher +20 more
core +1 more source
Horizontal Visibility graphs generated by type-I intermittency [PDF]
, 2013 The type-I intermittency route to (or out of) chaos is investigated within the Horizontal Visibility graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct, according ...
Gómez, José Patricio +4 more
core +3 more sources
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
Finitely forcible graph limits are universal [PDF]
, 2018 The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly within ...
Cooper, Jacob W. +2 more
core +2 more sources
Problems in extremal graph theory [PDF]
, 2010 We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable.
Ozkahya, Lale
core