Turán Graphs, Stability Number, and Fibonacci Index
Fuente:
arXiv
Saved in:
| Main Authors: | Bruyère, Véronique, Mélot, Hadrien |
|---|---|
| Format: | Preprint |
| Published: |
2008
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
by: Bruyère, Véronique, et al.
Published: (2008)
by: Bruyère, Véronique, et al.
Published: (2008)
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018)
by: Devillez, Gauvain, et al.
Published: (2018)
Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)
by: Hertz, Alain, et al.
Published: (2021)
Maximum Eccentric Connectivity Index for Graphs with Given Diameter
by: Hauweele, Pierre, et al.
Published: (2018)
by: Hauweele, Pierre, et al.
Published: (2018)
Extremal Chemical Graphs for the Arithmetic-Geometric Index
by: Hertz, Alain, et al.
Published: (2024)
by: Hertz, Alain, et al.
Published: (2024)
The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)
by: Hertz, Alain, et al.
Published: (2022)
PHOEG: an online tool for discovery and education in extremal graph theory
by: Bonte, Sébastien, et al.
Published: (2026)
by: Bonte, Sébastien, et al.
Published: (2026)
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)
by: Hertz, Alain, et al.
Published: (2021)
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)
by: Hertz, Alain, et al.
Published: (2021)
Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)
by: Bonte, Sébastien, et al.
Published: (2025)
Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)
by: Dusollier, Valentin, et al.
Published: (2025)
ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)
by: Bonte, Sébastien, et al.
Published: (2025)
Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)
by: Adak, Rajat, et al.
Published: (2026)
Trees with Given Stability Number and Minimum Number of Stable Sets
by: Bruyère, Véronique, et al.
Published: (2010)
by: Bruyère, Véronique, et al.
Published: (2010)
An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)
by: Adak, Rajat
Published: (2026)
Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
Net Occurrences in Fibonacci and Thue-Morse Words
by: Guo, Peaker, et al.
Published: (2025)
by: Guo, Peaker, et al.
Published: (2025)
On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)
by: Das, Sandip, et al.
Published: (2024)
An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
by: Sinha, Antika, et al.
Published: (2024)
by: Sinha, Antika, et al.
Published: (2024)
Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)
by: Ebrahimi, Javad B., et al.
Published: (2024)
On the Conjecture of the Representation Number of Bipartite Graphs
by: Mozhui, Khyodeno, et al.
Published: (2025)
by: Mozhui, Khyodeno, et al.
Published: (2025)
Basis Number of Graphs Excluding Minors
by: Geniet, Colin, et al.
Published: (2026)
by: Geniet, Colin, et al.
Published: (2026)
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Antimagic Labeling of Graphs Using Prime Numbers
by: Islam, Arafat, et al.
Published: (2024)
by: Islam, Arafat, et al.
Published: (2024)
Counting the Number of Domatic Partition of a Graph
by: Alikhani, Saeid, et al.
Published: (2024)
by: Alikhani, Saeid, et al.
Published: (2024)
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Representation Number of Word-Representable Split Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Paired Disjunctive Domination Number of Middle Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2025)
by: Golpek, Hande Tuncel, et al.
Published: (2025)
Dynamical Stability of Threshold Networks over Undirected Signed Graphs
by: Goles, Eric, et al.
Published: (2023)
by: Goles, Eric, et al.
Published: (2023)
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)
by: Schneider, Samuel, et al.
Published: (2025)
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)
by: Förster, Henry
Published: (2024)
Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)
by: Anto, Nevil, et al.
Published: (2023)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)
by: Jungeblut, Paul, et al.
Published: (2022)
New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)
by: Pikhurko, Oleg, et al.
Published: (2024)
Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)
by: Gerke, S., et al.
Published: (2026)
Complexity of Deciding the Equality of Matching Numbers
by: Gomes, Guilherme C. M., et al.
Published: (2024)
by: Gomes, Guilherme C. M., et al.
Published: (2024)
Growth Rate of the Number of Empty Triangles in the Plane
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
by: Kishi, Kaisei, et al.
Published: (2025)
by: Kishi, Kaisei, et al.
Published: (2025)
Similar Items
-
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
by: Bruyère, Véronique, et al.
Published: (2008) -
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018) -
Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021) -
Maximum Eccentric Connectivity Index for Graphs with Given Diameter
by: Hauweele, Pierre, et al.
Published: (2018) -
Extremal Chemical Graphs for the Arithmetic-Geometric Index
by: Hertz, Alain, et al.
Published: (2024)