The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2006, volume: 306, number: 14

  1. B. Roy, A. R. Rao, Dwijendra K. Ray-Chaudhuri
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1463- [Journal]
  2. K. T. Arasu, Grady Burkett, Michael Linger
    Existence status of some previously open abelian difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1467-1473 [Journal]
  3. Tiru S. Arthanari
    On pedigree polytopes and Hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1474-1492 [Journal]
  4. Alphonse Baartmans, Sharad S. Sane
    A characterization of projective subspaces of codimension two as quasi-symmetric designs with good blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1493-1501 [Journal]
  5. Bhaskar Bagchi
    On strongly regular graphs with µ <=2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1502-1504 [Journal]
  6. Robert Benkoczi, Binay K. Bhattacharya, D. Breton
    Efficient computation of 2-medians in a tree network with positive/negative weights. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1505-1516 [Journal]
  7. Subir Kumar Bhandari, Mausumi Bose
    Some results related to permanental inequalities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1517-1521 [Journal]
  8. Derek Bingham, Rahul Mukerjee
    Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1522-1533 [Journal]
  9. Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
    Labeling trees with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1534-1539 [Journal]
  10. Sugata Gangopadhyay, Pradipkumar H. Keskar, Subhamoy Maitra
    Patterson-Wiedemann construction revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1540-1556 [Journal]
  11. Yury J. Ionin, Mohan S. Shrikhande
    Decomposable symmetric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1557-1568 [Journal]
  12. Meena Mahajan, Raghavan Rama, S. Vijayakumar
    On sorting by 3-bounded transpositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1569-1585 [Journal]
  13. S. Mishra, S. B. Rao
    Minimum monopoly in regular and tree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1586-1594 [Journal]
  14. A. R. Rao
    The number of reachable pairs in a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1595-1600 [Journal]
  15. Malay Sen, P. Talukdar, Sandip Das
    Chronological orderings of interval digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1601-1609 [Journal]
  16. N. M. Singhi
    Tags on subsets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1610-1623 [Journal]
  17. V. Swaminathan, P. Jeyanthi
    Super edge-magic strength of fire crackers, banana trees and unicyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:14, pp:1624-1636 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002