Maximum k-regular induced subgraphs

Journal of Combinatorial Optimization

Volumn 14, Issue 4, 2007, Pages 455-463

  Cardoso, Domingos M ^a   Kamiński, Marcin ^b   Lozin, Vadim ^b  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b the State University of New Jersey   (United States)

Author keywords

Graphs; Hamiltonian cycles; Independent sets; Induced matchings

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; SET THEORY;

HAMILTONIAN CYCLES; HOFFMAN BOUND; INDEPENDENT SETS; INDUCED MATCHINGS;

GRAPH THEORY;

EID: 34848851638     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9045-9     Document Type: Article

References (15)

1. Bussemaker FC, Cvetković DM, Seidel JJ (1978) Graphs related to exceptional root system. In:Hajnal A, Sós V (eds) Combinatorics, vol I, Colloquia mathematica societatis Janos Bolyai, vol 18. North-Holland, Amsterdam, pp 185-191
2. Cameron K (1989) Induced matchings. Discret Appl Math 24:97-102
3. Cardoso DM (2001) Convex quadratic programming approach to the maximum matching problem. J Global Optim 21:91-106
4. Cardoso DM, Cvetković DM (2006) Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number. Bull Acad Serbe Sci Arts Cl Sci Math Natur Sci Math 23:41-55
5. Cardoso DM, Rama P (2004) Equitable bipartions and related results. J Math Sci 120:869-880 (special issue: Aveiro seminar on control, optimization and graph theory)
6. Cardoso DM, Rama P (2007) Spectral results on regular graphs with (k,τ)-regular sets. Discret Math (to appear). doi: 10.1016/j.disc.2005.11. 068
7. Cvetković DM, Doob M, Sachs H (1971) Spectra of graphs-theory and application. Academic, New York
8. Garey MR, Johnson DS (1979) Computers and Intractability. Freeman, San Francisco
9. Georges JP, Halsey MD, Sanaulla AM, Whittlesey MA (1990) Edge domination and graph structure. Congr Numer 76:127-144
10. Grinstead DL, Slater PJ, Sherwani NA, Holmes ND (1993) Efficient edge domination problems in graphs. Inf Process Lett 8:221-228
11. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85-104
12. Lovász L (1979) On the Shannon capacity of a graph. IEEE Trans Inf Theory 25(2):1-7
13. Luz CJ (1995) An upper bound on the independence number of a graph computable in polynomial time. Oper Res Lett 18:139-145
14. Stockmeyer LJ, Vazirani VV (1982) NP-completeness of some generalizations of the maximum matching problem. Inf Process Lett 15:14-19
15. Thompson DM (1981) Eigengraphs: constructing strongly regular graphs with block designs. Util Math 20:83-115