A note on eigenvalue bounds for independence numbers of non-regular graphs Fulltext Access 4 Pages 2014
New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth Fulltext Access 5 Pages 2014
Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs Fulltext Access 5 Pages 2014
On a family of binary completely transitive codes with growing covering radius Fulltext Access 5 Pages 2014
On the relative distances of eleven points in the boundary of a plane convex body Fulltext Access 5 Pages 2014
Incidence matrices of finite attenuated spaces and class dimension of association schemes Fulltext Access 5 Pages 2014
Extremal graphs for the geometric-arithmetic index with given minimum degree Fulltext Access 5 Pages 2014
On the structure of arbitrarily partitionable graphs with given connectivity Fulltext Access 5 Pages 2014
Diagnosis of constant faults in iteration-free circuits over monotone basis Fulltext Access 5 Pages 2014
The second Zagreb indices of unicyclic graphs with given degree sequences Fulltext Access 5 Pages 2014
Relationship between the edge-Wiener index and the Gutman index of a graph Fulltext Access 5 Pages 2014
Independent domination in subcubic bipartite graphs of girth at least six Fulltext Access 5 Pages 2014
Note on the greedy parsing optimality for dictionary-based text compression Fulltext Access 5 Pages 2014
Remarks concerning the freeness problem over morphism and matrix semigroups Fulltext Access 5 Pages 2014
Approximation algorithm for the minimum weight connected k-subgraph cover problem Fulltext Access 5 Pages 2014
On a class of nilpotent table algebras and applications to association schemes Fulltext Access 6 Pages 2014
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank Fulltext Access 6 Pages 2014
Some improved bounds on communication complexity via new decomposition of cliques Fulltext Access 6 Pages 2014
Exponentiality of the exchange algorithm for finding another room-partitioning Fulltext Access 6 Pages 2014
An improved parameterized algorithm for the independent feedback vertex set problem Fulltext Access 6 Pages 2014
Total coloring of planar graphs with 7-cycles containing at most two chords Fulltext Access 6 Pages 2014
One-sided random context grammars with a limited number of right random context rules Fulltext Access 6 Pages 2014
Edge coloring of planar graphs which any two short cycles are adjacent at most once Fulltext Access 6 Pages 2014