Advertisement

Independent sets in the graphs with bounded minors of the extended incidence matrix

  • V. E. Alekseev
  • D. V. Zakharova
Article

Abstract

We characterize the graphs with the absolute values of minors of the extended incidence matrix bounded above by some constant. We prove that, for every fixed k, the independent set problem is solvable in polynomial time for the graphs with the absolute value at most k of every minor of the matrix obtained from the incidence matrix by appending a column of 1s.

Keywords

extended incidence matrix minor independent set problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. E. Alekseev, “An Upper Bound of the Number of Maximal Independent Sets of a Graph,” Diskret. Mat. 19(3), 84–88 (2007).Google Scholar
  2. 2.
    V. A. Emelichev, O. I. Mel’nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lecture Notes on Graph Theory (Nauka, Moscow, 1990) [in Russian].Google Scholar
  3. 3.
    A. A. Zykov, Fundamentals of Graph Theory (Nauka, Moscow, 1987) [in Russian].Google Scholar
  4. 4.
    V. N. Shevchenko, Qualitative Problems of Integer Programming (Nauka, Moscow, 1995) [in Russian].Google Scholar
  5. 5.
    J.W. Grossman, D.M. Kilkarni, and I.E. Schochetman, “On the Minors of an Incidence Matrix and Its Smith Normal Form,” Linear Algebra Appl. 218, 213–224 (1995).MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    S. Tsukigama, M. Ide, H. Ariochi, and H. Ozaki, “A New Algorithm for Generating All the Maximal Independent Sets,” SIAM J. Comput. 6(3), 505–517 (1977).MathSciNetCrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2011

Authors and Affiliations

  1. 1.Department of Computational Mathematics and CyberneticsState University of Nizhnii NovgorodNizhnii NovgorodRussia

Personalised recommendations