• Home
  • Search
  • A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
  • https://doi.org/10.1007/s00236-024-00468-6Copy DOI Icon

A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R

Similar Papers
  • Research Article

A Note of Independent Number and Domination Number of Qn,k,m-Graph

  • Sep 01, 2019
  • Parallel Processing Letters
  • Jiafei Liu +4
  • PDF
  • Research Article
  • Citations4

Common Independence in Graphs

  • Aug 02, 2021
  • Symmetry
  • Magda Dettlaff +2
  • Research Article
  • Citations1

Efficiently recognizing graphs with equal independence and annihilation numbers

  • Mar 05, 2023
  • Information Processing Letters
  • Johannes Rauch +1
  • Research Article

BOUNDS ON HARARY INDEX WITH RESPECT TO VERTEX CONNECTIVITY, INDEPENDENT NUMBER AND INDEPENDENT DOMINATION NUMBER OF A GRAPH

  • Nov 03, 2020
  • Advances in Mathematics: Scientific Journal
  • V.V Manjalapur +1
  • Research Article
  • Citations4

On forbidden induced subgraphs for [formula omitted]-free perfect graphs

  • Mar 11, 2019
  • Discrete Mathematics
  • Christoph Brause +5
  • PDF
  • Research Article
  • Citations6

A characterization of trees with equal 2-domination and 2-independence numbers

  • Mar 09, 2017
  • Discrete Mathematics & Theoretical Computer Science
  • Christoph Brause +2
  • PDF
  • Research Article
  • Citations3

On independent position sets in graphs

  • Mar 01, 2021
  • Proyecciones (Antofagasta)
  • Elias John Thomas +1
  • Research Article
  • Citations29

On Independent Platform Sample Number for Reverberation Chamber Measurements

  • Dec 01, 2012
  • IEEE Transactions on Electromagnetic Compatibility
  • Xiaoming Chen
  • Research Article
  • Citations6

Connectivity, diameter, independence number and the distance spectral radius of graphs

  • Apr 13, 2017
  • Linear Algebra and its Applications
  • Minjie Zhang +2
  • PDF
  • Research Article

Independence Number, Neighborhood Intersection and Hamiltonian Properties

  • Jun 27, 2009
  • Boletim da Sociedade Paranaense de Matemática
  • Fan Yunzheng
  • Research Article
  • Citations3

The maximum number of maximum generalized 4‐independent sets in trees

  • May 30, 2024
  • Journal of Graph Theory
  • Pingshan Li +1
  • PDF
  • Research Article
  • Citations22

Two Degree Distance Based Topological Indices of Chemical Trees

  • Jan 01, 2019
  • IEEE Access
  • Shehnaz Akhter
  • Research Article
  • Citations10

On NP-hardness of the clique partition—Independence number gap recognition and related problems

  • Feb 24, 2006
  • Discrete Mathematics
  • Stanislav Busygin +1
  • Research Article
  • Citations5

Independence numbers of hypergraphs with sparse neighborhoods

  • Oct 30, 2003
  • European Journal of Combinatorics
  • Guofei Zhou +1
  • PDF
  • Research Article
  • Citations16

A New Lower Bound on the Independence Number of a Graph and Applications

  • Feb 21, 2014
  • The Electronic Journal of Combinatorics
  • Michael A Henning +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.