相关论文: The Cost of 2-Distinguishing Hypercubes

A simple probabilistic argument shows that every $r$-uniform hypergraph with $m$ edges contains an $r$-partite subhypergraph with at least $\frac{r!}{r^r}m$ edges. The celebrated result of Edwards states that in the case of graphs, that is…

An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at distance 2 are assigned distinct numbers. The L(2, 1)-labeling…

We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which consists of 13 classes of specific graphs. These 13 classes hint that $c_{2}\in [1/2, \sqrt{2+\sqrt{5}}]$, where $c_2$ is the minimum real…

For an edge-colored graph $G$, a set $F$ of edges of $G$ is called a \emph{proper cut} if $F$ is an edge-cut of $G$ and any pair of adjacent edges in $F$ are assigned by different colors. An edge-colored graph is \emph{proper disconnected}…

A dissociation set in a graph is a set of vertices inducing a subgraph of maximum degree at most $1$. Computing the dissociation number ${\rm diss}(G)$ of a given graph $G$, defined as the order of a maximum dissociation set in $G$, is…

A subset $X$ of vertices in a graph $G$ is a {\em diameter 2 subset} if the distance of any two vertices of $X$ is at most two {\em in $G[X]$}. Relaxing this notion, a subset $X$ of vertices in a graph $G$ is a {\em 2-reachable subset} if…

Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2\Delta(\lceil…

A $(2,1)$-total labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ and the edge set $E(G)$ to the set $\{0,1,...,k\}$ of nonnegative integers such that $|f(x)-f(y)|\ge 2$ if $x$ is a vertex and $y$ is an edge incident…

Many authors have investigated edge decompositions of graphs by the edge sets of isomorphic copies of special subgraphs. For $q$- dimensional hypercubes $Q_q$ various researchers have done this for cer- tain trees, paths, and cycles. In…

Let $G$ be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of $G$ that maintains respectively: the $2$-edge-connected blocks of $G$…

A good edge-labeling of a graph [Ara\'ujo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there exist two non-decreasing paths. In this paper, we study…

The hypergraph duality problem DUAL is defined as follows: given two simple hypergraphs $\mathcal{G}$ and $\mathcal{H}$, decide whether $\mathcal{H}$ consists precisely of all minimal transversals of $\mathcal{G}$ (in which case we say that…

For an edge-colored graph $G$, we call an edge-cut $M$ of $G$ monochromatic if the edges of $M$ are colored with the same color. The graph $G$ is called monochromatic disconnected if any two distinct vertices of $G$ are separated by a…

Among all simple nonbipartite 2-connected graphs and among all nonbipartite $\theta$-graphs, the minimum least $Q$-eigenvalues are completely determined, respectively.

A Hypercube $Q_n$ is a graph in which the vertices are all binary vectors of length n, and two vertices are adjacent if and only if their components differ in exactly one place. A galaxy or a star forest is a union of vertex disjoint stars.…

Let $G$ be a finite, connected graph of order of at least 2, with vertex set $V(G)$ and edge set $E (G)$. A set $S$ of vertices of the graph $G$ is a doubly resolving set for $G$ if every two distinct vertices of $G$ are doubly resolved by…

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

A graph $G$ is said to be $2$-divisible if for all (nonempty) induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A,B$ such that $\omega(A) < \omega(H)$ and $\omega(B) < \omega(H)$. A graph $G$ is said to be perfectly…

We study the question of ``how robust are the known lower bounds of labeling schemes when one increases the number of consulted labels''. Let $f$ be a function on pairs of vertices. An $f$-labeling scheme for a family of graphs $\cF$ labels…

A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. We propose a series of new labeling…