Nordhaus--Gaddum bounds for independent domination
Discrete Mathematics
Note on the connectivity of line graphs
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Sufficient conditions for λ′-optimality of graphs with small conditional diameter
Information Processing Letters
Trees with Equal Domination and Restrained Domination Numbers
Journal of Global Optimization
Eliminating graphs by means of parallel knock-out schemes
Discrete Applied Mathematics
Isomorphic factorization, the Kronecker product and the line digraph
Information Processing Letters
Taking students out for a ride: using a board game to teach graph theory
Proceedings of the 38th SIGCSE technical symposium on Computer science education
A sufficient condition for Pk-path graphs being r-connected
Discrete Applied Mathematics
On the edge-connectivity and restricted edge-connectivity of a product of graphs
Discrete Applied Mathematics
A formula for the number of labelled trees
Computers & Mathematics with Applications
Balanced decomposition of a vertex-colored graph
Discrete Applied Mathematics
Superconnectivity of regular graphs with small diameter
Discrete Applied Mathematics
On the 3-restricted edge connectivity of permutation graphs
Discrete Applied Mathematics
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science
On the number of components of (k,g)-cages after vertex deletion
Discrete Applied Mathematics
Calculating the extremal number ex(v;{C3,C4,...,Cn})
Discrete Applied Mathematics
A linear relaxation technique for the position analysis of multiloop linkages
IEEE Transactions on Robotics
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
A top-down approach to add hot-pluggable asynchronous devices to RAPIEnet infrastructure
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Maximum number of frequencies in oscillations generated by fractional order LTI systems
IEEE Transactions on Signal Processing
Superconnectivity of graphs with odd girth g and even girth h
Discrete Applied Mathematics
Domination number of Cartesian products of directed cycles
Information Processing Letters
Computational Geometry: Theory and Applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On domination number of Cartesian product of directed paths
Journal of Combinatorial Optimization
On incentive compatible competitive selection protocol
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Girth of {C3,...,Cs} -free extremal graphs
Discrete Applied Mathematics
Vertex covers and eternal dominating sets
Discrete Applied Mathematics
Irredundant set faster than O(2n)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Computing gene functional similarity using combined graphs
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Journal of Graph Theory
Equality of domination and transversal numbers in hypergraphs
Discrete Applied Mathematics
Graph access structures with optimal pixel expansion three
Information and Computation
| Hi-index | 0.00 |