Equitable Bipartitions of Graphs and Related Results
Authors:
- D. M. CardosoDCD. M. Cardoso
- P. C. RamaPRP. C. Rama
- 1 March 2004
- journal article
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 120 (1) , 869-880
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Stable sets in certain P6-free graphsDiscrete Applied Mathematics, 1999
- On graphs with three eigenvaluesDiscrete Mathematics, 1998
- An upper bound on the independence number of a graph computable in polynomial-timeOperations Research Letters, 1995
- The walk partition and colorations of a graphLinear Algebra and its Applications, 1982
- A surprising property of the least eigenvalue of a graphLinear Algebra and its Applications, 1982
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoileDiscrete Mathematics, 1980
- Computing the Characteristic polynomial of a graph1974
- An interrelation between line graphs, eigenvalues, and matroidsJournal of Combinatorial Theory, Series B, 1973
- Reducibility among Combinatorial Problems1972