Full friendly index set — I
- 19 November 2012
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (9) , 1262-1274
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On friendly index sets of 2-regular graphsDiscrete Mathematics, 2008
- Full friendly index sets of P2×PnDiscrete Mathematics, 2008
- Uniformly cordial graphsDiscrete Mathematics, 2006
- The computational complexity of cordial and equitable labellingDiscrete Mathematics, 2000
- Some results on the achromatic numberJournal of Graph Theory, 1997
- Cordial labeling of mKnDiscrete Mathematics, 1997
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- A-cordial graphsDiscrete Mathematics, 1991
- The bisection width of cubic graphsBulletin of the Australian Mathematical Society, 1989