Add to ORKGWe present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a certain star decomposition. We relate the Boolean dimension with the inversion index of a tournament
International audienceThe metric dimension of a graph is the minimum size of a set of vertices such ...
Let Γ be a simple connected undirected graph with vertex set VΓ and edge set EΓ. The metric dimensio...
AbstractA decomposition F={F1,F2,…,Fr} of the edge set of a graph G is called a resolving r-decompos...
an expanded version of this paper will be submitted to Discrete mathematics and computer scienceInte...
This paper initiates a study on the problem of computing the difference between the metric dimension...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
summary:The cubical dimension of a graph $G$ is the smallest dimension of a hypercube into which $G$...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G adm...
A graph $G$ on $n$ vertices is a \emph{threshold graph} if there exist real numbers $a_1,a_2, \ldots...
Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/152495/1/mtks0025579300005222.pd
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in ...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
As a generalization of the concept of the partition dimension of a graph, this article introduces th...
The Fibonacci dimension fdim▫$(G)$▫ of a graph ▫$G$▫ was introduced in [S. Cabello, D. Eppstein and ...
International audienceThe metric dimension of a graph is the minimum size of a set of vertices such ...
Let Γ be a simple connected undirected graph with vertex set VΓ and edge set EΓ. The metric dimensio...
AbstractA decomposition F={F1,F2,…,Fr} of the edge set of a graph G is called a resolving r-decompos...
an expanded version of this paper will be submitted to Discrete mathematics and computer scienceInte...
This paper initiates a study on the problem of computing the difference between the metric dimension...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
summary:The cubical dimension of a graph $G$ is the smallest dimension of a hypercube into which $G$...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G adm...
A graph $G$ on $n$ vertices is a \emph{threshold graph} if there exist real numbers $a_1,a_2, \ldots...
Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/152495/1/mtks0025579300005222.pd
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in ...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
As a generalization of the concept of the partition dimension of a graph, this article introduces th...
The Fibonacci dimension fdim▫$(G)$▫ of a graph ▫$G$▫ was introduced in [S. Cabello, D. Eppstein and ...
International audienceThe metric dimension of a graph is the minimum size of a set of vertices such ...
Let Γ be a simple connected undirected graph with vertex set VΓ and edge set EΓ. The metric dimensio...
AbstractA decomposition F={F1,F2,…,Fr} of the edge set of a graph G is called a resolving r-decompos...