Vol. 75 (2008): Volume 75, 2008

Articles

• Bipartite-assembly

  Farrell, Edward J., Gargano, Michael L., Quintas, Louis V.

• Automated bounds on recursive structures

  Goddard, Wayne

• Some further vertex turán numbers for cube graphs

  Harborth, Heiko, Nienborg, Hauke

• Families of regular graphs with constant metric dimension

  Javaid, Imran, Rahim, M. Tariq, Ali, Kashif

• Graphs with n-3 isomorphic vertex-deleted subgraphs and their reconstructibility

  Ramachandran S., Monikandan S.

• A study of total relative displacements of permutations in paths and cycles

  Cheng, Kai-Chung, Fu, Hung-Lin, Chiang, Nam-Po, Tzeng, Chien-Kuo

• The crossing number of Knödel graph W3,n

  Wenping, Zheng, Xiaohui, Lin, Yuansheng, Yang, Chengrui, Deng

• Kronecker sum of binary orthogonal arrays

  Sinha K., Vellaisamy P., Sinha N.

• A linear space algorithm for the heaviest common subsequence problem

  Li, Rao

• On recognition property of some projective special linear groups by their element orders

  Darafsheh M.R., Karamzadeh N.S.

• Combinatorial identities on binomial coefficients and harmonic numbers

  Chu, Wenchang, Yan, Qinglun

• Pancyclism of 3-domination-critical graphs with small minimum degree

  Shiu W.C., Zhang, Lian-Zhu

• Szeged index of TUC4C8 (S) nanotube

  Iranmanesh A., Pakravesh Y.

• Optimal crossover designs under premature stopping

  Bose, Mausumi, Bagchi, Sunanda

• Two combinatorial problems involving lottery schemes: Characterising solution set structures

  Burger A.P., Grun̈dlingh W.R., Van Vuuren J.H.

• Non-intersecting detours in strong oriented graphs

  Van Aardt, Susan, Semanišin, Gabriel

• The P3 intersection graph

  Menon, Manju K., Vijayakumar A.

• More asymptotic formulas for the generalized Stirling numbers of the first kind

  Vega, Mary Ann Ritzell P., Corcino, Cristina B.

• Defining set spectra for designs can have arbitrarily large gaps

  Havas, George, Lawrence, Julie L., Ramsay, Colin, Street, Anne Penfold, Yazici, Emine Şule