AbstractThe aim of the present paper is to study the properties of the hypercube related to the concept of domination. We derive upper and lower bounds and prove an interpolation theorem for related invariants
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractWe give two new characterizations of the Hamming graph, which is a natural generalization of...
AbstractIn this paper by a constructive method we show that the node connectivity of a hypercube of ...
Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertice...
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to dis...
AbstractWe present a comprehensive survey of the theory of hypercube graphs. Basic properties relate...
We revisit the problem of determining the independent domination number in hypercubes for which the ...
We bring in the techniques of independence complexes and the notion of total dominating sets of a gr...
AbstractThe use of hypercube graphs as the underlying architecture in many commercial parallel compu...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
In this thesis, we consider several hypergraph parameters and study whether restrictions to subclass...
Exchanged hypercubes [Loh et al., IEEE Transactions on Parallel and Dis-tributed Systems 16 (2005) 8...
AbstractWe show the link between the existence of perfect Lee codes and minimum dominating sets of C...
Superior domination polynomial SD(G, x) is a polynomial in which the power of the variable denotes t...
AbstractAn integer-valued graph function π is an interpolating function if for every connected graph...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractWe give two new characterizations of the Hamming graph, which is a natural generalization of...
AbstractIn this paper by a constructive method we show that the node connectivity of a hypercube of ...
Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertice...
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to dis...
AbstractWe present a comprehensive survey of the theory of hypercube graphs. Basic properties relate...
We revisit the problem of determining the independent domination number in hypercubes for which the ...
We bring in the techniques of independence complexes and the notion of total dominating sets of a gr...
AbstractThe use of hypercube graphs as the underlying architecture in many commercial parallel compu...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
In this thesis, we consider several hypergraph parameters and study whether restrictions to subclass...
Exchanged hypercubes [Loh et al., IEEE Transactions on Parallel and Dis-tributed Systems 16 (2005) 8...
AbstractWe show the link between the existence of perfect Lee codes and minimum dominating sets of C...
Superior domination polynomial SD(G, x) is a polynomial in which the power of the variable denotes t...
AbstractAn integer-valued graph function π is an interpolating function if for every connected graph...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractWe give two new characterizations of the Hamming graph, which is a natural generalization of...
AbstractIn this paper by a constructive method we show that the node connectivity of a hypercube of ...
DOI
Add to ORKG