The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences Fulltext Access 8 Pages 2011
A Furstenberg–Katznelson–Weiss type theorem on (d+1)(d+1)-point configurations in sets of positive density in finite field geometries Fulltext Access 8 Pages 2011
Adjoint polynomials of bridge–path and bridge–cycle graphs and Chebyshev polynomials Fulltext Access 8 Pages 2011
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 Fulltext Access 8 Pages 2011
On the modularity of the unified WRT invariants of certain Seifert manifolds Fulltext Access 8 Pages 2011
The 2-extendability of 5-connected graphs on surfaces with large representativity Fulltext Access 8 Pages 2011
Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph Fulltext Access 8 Pages 2011
On the number of shortest descending paths on the surface of a convex terrain Fulltext Access 8 Pages 2011
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem Fulltext Access 8 Pages 2011
Some inequalities for the atom-bond connectivity index of graph operations Fulltext Access 8 Pages 2011
Connectivity threshold and recovery time in rank-based models for complex networks Fulltext Access 8 Pages 2011
A new characterization of projections of quadrics in finite projective spaces of even characteristic Fulltext Access 8 Pages 2011
Vertex coloring complete multipartite graphs from random lists of size 2 Fulltext Access 8 Pages 2011
On the existence of kk-partite or KpKp-free total domination edge-critical graphs Fulltext Access 8 Pages 2011
NN-flips in even triangulations on the torus and Dehn twists preserving monodromies Fulltext Access 8 Pages 2011
On minimal polynomials over Fqm and over Fq of a finite-length sequence over Fqm Fulltext Access 8 Pages 2011
An analytic valuation method for multivariate contingent claims with regime-switching volatilities Fulltext Access 8 Pages 2011
Edge connectivity in difference graphs and some new constructions of partial sum families Fulltext Access 9 Pages 2011
Maximal independent sets in bipartite graphs obtained from Boolean lattices Fulltext Access 9 Pages 2011
Computational complexity of reconstruction and isomorphism testing for designs and line graphs Fulltext Access 9 Pages 2011