Cover Image

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Andriantiana, Eric O. D., Shozi, Zekhaya B.
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C30, 05C05, 05C35
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ratio of the number of $\mathbf{1}$-nearly independent vertex subsets and the Merrifield-Simmons index
by: Dossou-Olory, Audace A. V., et al.
Published: (2026)

On the average size of $1$-nearly independent vertex sets in graphs
by: Dossou-Olory, Audace A. V., et al.
Published: (2025)

Nordhaus-Gaddum-type theorems for maximum average degree
by: Caro, Yair, et al.
Published: (2025)

Nordhaus--Gaddum type bounds for the complement rank
by: Tang, Quanyu
Published: (2025)

On the Sombor index of trees with degree restrictions
by: Andriantiana, Eric O. D., et al.
Published: (2024)

Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
by: Akbari, Saieed, et al.
Published: (2024)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Generalized Turán problem with bounded matching number
by: Ma, Yue, et al.
Published: (2023)

The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)

The maximum number of paths of a given length in a nonhamiltonian graph
by: Li, Chengli, et al.
Published: (2026)

Extremal graphs with minimum number of connected subgraphs in a given family
by: Pandey, Dinesh, et al.
Published: (2025)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)

Mutual visibility in Moore graphs and $(d,2)$-graphs with defect
by: B, Tonny K, et al.
Published: (2025)

Bicyclic graphs with the smallest and largest numbers of connected sets
by: Dossou-Olory, Audace A. V.
Published: (2026)

On vertex peripherians and Wiener index of graphs with fixed number of cut vertices
by: Pandey, Dinesh
Published: (2024)

On the number of minimal forts of a graph
by: Becker, Paul, et al.
Published: (2024)

Number of independent transversals in multipartite graphs
by: Tang, Yantao, et al.
Published: (2025)

On the Maximum Number of Spanning Trees in $C_4$-Free Graphs
by: London, András
Published: (2026)

Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024)

On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)

Maximal independent sets in the middle two layers of the Boolean lattice
by: Balogh, József, et al.
Published: (2025)

A container theorem for general digraphs with forbidden subdigraphs
by: Liang, Meili, et al.
Published: (2026)

Trees maximizing the number of almost-perfect matchings
by: Cambie, Stijn, et al.
Published: (2022)

Cyclic subsets in regular Dirac graphs
by: Draganić, Nemanja, et al.
Published: (2025)

Lower bounds on the independence number of a graph in terms of degrees
by: Harant, Jochen, et al.
Published: (2025)

The Turán number of path-star forests
by: Fang, Xiaona, et al.
Published: (2023)

Upper bound for the number of maximal dissociation sets in trees
by: Wang, Ziyuan, et al.
Published: (2024)

How connectivity affects the extremal number of trees
by: Jiang, Suyun, et al.
Published: (2023)

Zarankiewicz numbers near the triple system threshold
by: Chen, Guangzhou, et al.
Published: (2023)

Successive vertex orderings of connected graphs
by: Agrawal, Prarthana, et al.
Published: (2026)

On the most reliable graphs with fixed redundancy
by: Brand, Rotem, et al.
Published: (2026)

Sparse Sets in Triangle-free Graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Turán number of four vertex-disjoint cliques
by: Kostochka, Alexandr, et al.
Published: (2025)

Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
by: Chudnovsky, Maria, et al.
Published: (2026)

The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)

Distribution of independent sets in perfect $r$-ary trees
by: Iľkovič, Daniel, et al.
Published: (2026)

Full classification of anti-van der Waerden numbers of graph products of forests
by: Berikkyzy, Zhanar, et al.
Published: (2025)

Hilton-Milner Theorem for the $r$-independent sets in a union of cliques
by: Gunderson, Karen, et al.
Published: (2025)

Symmetric and unimodal independence polynomials of trees
by: Hibi, Takayuki, et al.
Published: (2026)