The l₁-Embeddability of Hypertrees and Unicyclic Hypergraphs

Abstract

A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between the binary addresses in the graph is the Hamming distance. Due to the symmetry of the hypercube, one usually considers the graph embedded in the hypercube proportionally in distance, meaning that the $l_1$-graphs. In this paper, we determine the $l_1$-embeddability of hypertrees and unicyclic hypergraphs.

1. Background

In many complex systems, the interaction between substances is collective, and this interaction between groups is ubiquitous in many fields. For example, joint procurement of goods, the interaction of proteins, labels posted on posts on the same website, cooperation between researchers, and so on. However, the interaction between these groups cannot be represented by vertices and edges in simple graphs. Suppose three or more researchers wrote a book together—this book cannot be represented by an edge in the simple graph. Furthermore, if an edge is created among all researchers, many papers jointly written by some researchers cannot be distinguished [1]. Hypergraphs can naturally represent the interaction between groups because they are composed of vertices and hyperedges, which solves the inherent limitations of a simple graph. Each hyperedge of a hypergraph can be a subset of the vertex set and it can represent the group interaction between vertices, so research on hypergraphs is also extremely necessary.

Hypergraphs can better represent the real world. Complex structures similar to a mesh in life can be represented by hypergraphs. In the paper [2], Claude Berge first mentioned the concept of the hypergraph. In 1973, Paul Seymour [3] discussed the related problems of minimal hypergraphs which are not 2-colourable. Claude Berge [4] described the related concepts of hypergraphs and the theory of hypergraphs in 1989. Up to the 21st century, the study of hypergraphs has remained a very hot topic. In recent years, Zikai Tang, Xiuping Fang, and Yaoping Hou [5] discussed and studied the spectral radii of the k-uniform linear hypergraphs in 2018. Furthermore, Geon Lee, Jihoon Ko, and Kijung Shin [1] investigate the local structures of real-world hypergraphs with the help of algorithms in 2020. Xiangxiang Liu, Ligong Wang, and Xihe Li [6] found the Wiener index of special hypergraphs in 2020. Mario Gionfriddo and others studied the relevant concepts of hypercycle systems in 2020 [7]. However, no one has studied the $l_1$-embeddability of hypergraphs.

In the past half-century, people’s research on graph theory has shown an extremely active trend along with the rapid advancement of science and technology. The distance in a graph is a very important concept in graph theory, which is widely used in physics, chemistry, and computer information science. For example, when considering the distance between atoms in a chemical molecule, the distance between nodes in a traffic network, and the distance between nodes in a computer network, we only need to abstract the actual network into a graph, and then consider the distance between the vertices in the graph. A hypercube graph is a kind of graph with good symmetry, and the distance between any two vertices on it is the Hamming distance. In order to make the calculation of distance in the considered graph easier, people try to embed the considered graph into the hypercube graph proportionally. An $l_1$-graph refers to a graph that can be embedded into a hypercube proportionally. In the past few decades, the $l_1$-embeddability of graphs has been intensively studied. Assouad and Deza in [8,9] gave a judgment theorem on how to identify a graph as an $l_1$-graph. According to this result, a graph is an $l_1$-graph if and only if it can be embedded into a hypercube graph proportionally. Karzanov [10] proved that the identification problem for general $l_1$-spaces is NP-complete. Surprisingly, Shpectorov [11] proved that an $l_1$-graph can be recognized in polynomial time. Research on the $l_1$-graph is also in full swing. It has extensive and profound applications in complex networks, information science, transportation, chemical graph theory, circuit communication, and other fields. For example, consider the Wiener index of a graph, that is, the sum of the distances between all pairs of vertices in the graph. If calculated directly using the defined formula, its complexity is the cubic order of vertices. However, if the graph is $l_1$-embedded, its computational complexity can be reduced to the linear order of vertices.

To obtain more useful information or simpler algorithms, people usually put the studied complex objects into some well-studied mature space. Based on this, one usually considers putting the research objects into the $l_1$-space. Studying the $l_1$-embeddability of hypergraphs is of great significance to real life. For example, how connecting the particles of a molecule makes the molecular structure more stable; How connecting wires between the wiring ports of the circuit board makes the battery thinner and more practical. Therefore, it is necessary to study the $l_1$-embeddability of hypergraphs. In this paper, we characterize the $l_1$-embeddability of hypertrees and unicyclic hypergraphs.

2. Preliminaries

A hypergraph $H=(V,E)$ is an ordered pair of a finite set of vertices, the vertex set V, and a finite multiset of hyperedges, the edge set E, such that each hyperedge is a non-empty subset of V, i.e., $E_i\subseteq V$ for all $E_i\in E$. The number of vertices contained in the hypergraph is called the order of the hypergraph, which is denoted as $\left|V\left(H\right)\right|$. The number of hyperedges included in the hypergraph is called the size of the hypergraph, which is denoted as $\left|E\left(H\right)\right|$. Consequently, a graph is a hypergraph $H=(V,E)$, where each hyperedge is a set of at most two vertices: $|E_i|\le 2$ for all $E_i\in E$ [2,12].

A simple hypergraph is a hypergraph H such that $E_i\subset E_j\Rightarrow i=j$. A simple graph is a simple hypergraph each of whose hyperedges has two vertices [4].

Throughout this article, we focus on simple hypergraphs, meaning that the number of vertices on each hyperedge is greater than or equal to 2 [12]. In this paper, the graphs we consider are simple graphs.

The maximum number of vertices contained in the hyperedges of the hypergraph is denoted by the rank of the hypergraph. The minimum number of vertices contained in the hyperedges of the hypergraph is denoted by the lower rank of the hypergraph. When each hyperedge of the hypergraph contains the same number of vertices (i.e., $rank$=$lower$$rank$), the hypergraph H is called a uniform hypergraph [4]. A simple uniform hypergraph of rank k is called a k-uniform hypergraph [4,12].

For any vertex v in the vertex set V, the number of hyperedges that contain v is called the degree of vertex v in the hypergraph H, denoted as $d_H\left(v\right)$.

In the hypergraph H, a vertex-hyperedge sequence $\left(v_1,E_1,v_2,E_2,\dots ,E_k,v_{k+1}\right)$ is called a chain of length k [3], simply $\left(v_1,v_{k+1}\right)$-chain, if it satisfies: (1) For any two vertices, $v_i\ne v_j\left(i\ne j,1\le i,j\le k+1\right)$; (2) For any two hyperedges in the hypergraph $E_i\ne E_j\left(i\ne j,1\le i,j\le k\right)$; (3) $v_p,v_{p+1}\in E_p(1\le p\le k)$. In particular, if $v_1=v_{k+1}$, then this chain is called a hypercycle of the hypergraph. If $k>2$, the hypercycle is called significant [13]. Denotes a hypercycle of m hyperedges by $H{C}_m$. Accordingly, in a simple graph, a cycle is a hypercycle in which each hyperedge contains two vertices. In particular, the k cycle is denoted by $C_k$.

If there is a $\left(v_i,v_j\right)$-$chain$ in a hypergraph, $v_i$ and $v_j$ are said to be connected. If there is a chain between any two vertices of the hypergraph, the hypergraph is said to be $connected$. A connected hypergraph with no hypercycle is called a $hypertree$, denoted by $HT$. If $d_{HT}\left(x\right)\ge 2$, then the vertex x is called the branch vertex of $HT$. If two hyperedges $E_1$ and $E_2$ share the same branch vertex x, they are said to be adjacent. In this case, $x\in E_1$ and $x\in E_2$. If two vertices are in the same hyperedge, they are called adjacent.

Let $E^{\prime }$ be a subset of E and let S denote the subset of V consisting of all vertices in H of hyperedges in $E^{\prime }$. Then the hypergraph $(S,E^{\prime })$ is the subhypergraph of H induced by the hyperedge set $E^{\prime }$ of H. It is denoted by $H\left[E^{\prime }\right]$ [14].

In a connected hypergraph, among all $\left(v_i,v_j\right)$-chains, the least number of hyperedges contained in the $\left(v_i,v_j\right)$-$chain$ is called the distance between $v_i$ and $v_j$, denoted as $d_H\left(v_i,v_j\right)$ [3].

For a hypergraph H = $\left(V,E\right)$, if $\left|E_i\cap E_j\right|\le 1$, H is called a $linear$$hypergraph$ [4], whenever $i\ne j$, $E_i\in E$, $E_j\in E$.

For a hyperedge $E_i$ of a hypergraph, if there is exactly one vertex whose degree is at least 2, $E_i$ is called a hanged hyperedge.

For $v\in V$, a superstar of H—with v as a center—is the set of hyperedges that contains v [15]. If each hyperedge in the superstar contains k vertices, it is called a k-uniform superstar. This denotes a k-uniform superstar with n vertices and m hyperedges by $S_n^k$. It is clear that $S_n^k$ satisfies $m=\frac{n-1}{k-1}$.

If the hypergraph is connected and it has only one hypercycle, then it is a unicyclic hypergraph. When a unicyclic hypergraph contains m hyperedges, it is denoted by $H{U}_m$.

Let X be the set of all real number sequences $x=\left(x_1,x_2,\dots \right)$, where ${\sum }_{p=1}^{\infty }{|x}_p|<\infty$. For any $x,y\in X$, define the distance function $d_1\left(x,y\right)={\sum }_{p=1}^{\infty }{|x}_p-y_p|$. Then $\left(X,d_1\right)$ is a metric space, usually called the $l_1$-space. If $Y\subseteq X$ and Y is linear space, then the metric space $\left(Y,d_1\right)$ is called the subspace of $l_1$-space [16].

Let $G=\left(V,E\right)$ be a connected graph. For any two vertices u and v, $d_G\left(u,v\right)$ represents the distance between u and v in graph G, that is, the length of the shortest path connecting u and v. Obviously $d_G$ is a metric on $V\left(G\right)$, and $\left(V\left(G\right),d_G\right)$ is a metric space, called the graphic metric space associated with G [17,18].

A graph G is an $l_1$-graph [19] if the metric space $\left(V\left(G\right),d_G\right)$ is an isometric subspace of $l_1$-space. If graph G is an $l_1$-graph, then graph G has the $l_1$-embeddability property. That is, there is a distance-maintaining mapping $\varphi$ from $V\left(G\right)$ to X, such that for any two vertices $x,y\in V,d_G\left(x,y\right)=d_1\left(\varphi \left(x\right),\varphi \left(y\right)\right)$.

An n-dimensional hypercube or n-cube $Q_n$ is defined as follows: the n-cube is a graph whose vertices are the ordered n-tuples of 0’s and 1’s, two vertices being joined if and only if they differ in exactly one coordinate [14,16].

In 1980, Assouad and Deza [8] proved that a graph G is an $l_1$-graph if and only if there are two positive integers $\lambda$ and n, the graph G can be scale-$\lambda$-embedded into a hypercube $Q_n$. That is, for any two vertices $x,y\in V\left(G\right)$, there is a mapping $\phi :V\left(G\right)\to V\left(Q_n\right)$, which satisfies $\lambda ·d_G\left(x,y\right)=d_{Q_n}\left(\phi \left(x\right),\phi \left(y\right)\right)$. Among them, $\lambda$ is called the scale of G [20]. For convenience, we use $G\to \frac{1}{\lambda }{Q}_n$ to denote that graph G is scale-$\lambda$-embeddable into the hypercube $Q_n$.

A subset S of vertices of a graph G is convex if for any two vertices u, v of S all vertices on shortest $u,v$-paths belong to S. Divide the vertex set $V\left(G\right)$ into two non-empty parts A and B, satisfying $\left(1\right)A\cup B=V\left(G\right)$; $\left(2\right)A\cap B=\varnothing ,\left\{A,B\right\}$ called a cut of G. If both A and B are convex, then the cut $\left\{A,B\right\}$ is a convex cut [21,22]. A cut $\{A,B\}$ of Gcuts an edge $uv$ if $u\in A$ and $v\in B$. It was known that $l_1$-graphs can be recognized by convex cuts [21,22].

Theorem 1

([21,22]). A graph G is scale-λ-embeddable into a hypercube if and only if there exists a collection $\mathcal{C}\left(G\right)$ of convex cuts (not necessarily distinct) such that every edge of G is cut by exactly λ cuts from $\mathcal{C}\left(G\right)$. Furthermore, if $\mathcal{C}\left(G\right)$ has n cuts, G can be scale-λ-embeddable into the hypercube $Q_n$.

3. ${\mathbf{L}}_{\mathbf{1}}$-Embeddability of Hypertrees

Before discussing the $l_1$-embeddability of hypergraphs, we must give several lemmas to facilitate the proof of the main theorems. Deza and Laurent proposed some examples of $l_1$-graphs in [23]. They also presented some operations which preserve $l_1$-embeddability such as “1-$sum$” and direct product of two $l_1$-graphs. Here “1-$sum$” of two graphs means identifying a single vertex from two graphs. Let $G_1$ and $G_2$ be two disjoint graphs, where the vertex $a_1\in V\left(G_1\right)$, vertex $a_2\in V\left(G_2\right)$. Now identify vertex $a_1$ and vertex $a_2$ into a new vertex x, such that $x=a_1=a_2$. We say that the resulting graph is obtained by identifying a single vertex x from $G_1$ and $G_2$, and denote it by $G_1{\bigcup }_x{G}_2$. This operation is called “1-$sum$” operation. At the same time, we denote that $G_1{\bigcup }_x{G}_2=G_1+G_2$ and $G_1=\left(G_1{\bigcup }_x{G}_2\right)-G_2$.

Firstly, the definition of a complete graph is given. A simple graph G is said to be complete if every pair of distinct vertices of G are connected in G [14]. A complete graph with n vertices is often denoted by $K_n$.

Lemma 1

([23]). $K_n\to \frac{1}{2}{Q}_n$.

Lemma 2

([23]). Let $G_1$ and $G_2$ be two $l_1$-graphs. Then $G_1{\bigcup }_x{G}_2$ is an $l_1$-graph.

Lemma 3.

Every hypertree with m hyperedges $(m\ge 2)$ has at least two hanged hyperedges.

Proof. 

Let $P=(v_1,E_1,v_2,E_2,\cdots ,E_k,v_{k+1})$ be the longest chain in the hypertree $HT$. It can be assumed that $v_1$ is any 1-degree vertex in $E_1$, and $v_{k+1}$ is any 1-degree vertex in $E_k$. The hyperedge $E_1$ has no adjacent hyperedge at vertex $v_1$. Similarly, the hyperedge $E_k$ has no adjacent hyperedge at vertex $v_{k+1}$. Otherwise, either a hypercycle is formed, or a chain longer than P is formed, but this is clearly impossible. Therefore, the hyperedge $E_1$ and the hyperedge $E_k$ are two hanged hyperedges. Hence, every hypertree with m hyperedges $(m\ge 2)$ has at least two hanged hyperedges. □

Lemma 4

([18]). For any nonnegative integer k, if $G\to \frac{1}{\lambda }{Q}_n$, then $G\to \frac{1}{\lambda }{Q}_{n+k}$.

Lemma 5.

If $G_1\to \frac{1}{\lambda }{Q}_{n_1}$ and $G_2\to \frac{1}{\lambda }{Q}_{n_2}$, then $G_1{\bigcup }_x{G}_2\to \frac{1}{\lambda }{Q}_{n_1+n_2}$.

Proof. 

Let $n_1$ and $n_2$ be two positive integers. In addition, $G_1\to \frac{1}{\lambda }{Q}_{n_1}$ and $G_2\to \frac{1}{\lambda }{Q}_{n_2}$. Let $G_1{\bigcup }_x{G}_2$ be obtained by identifying single vertices x from $G_1$ and $G_2$. By Lemma 4, there are $G_1\to \frac{1}{\lambda }{Q}_{n_1+n_2}$ and $G_2\to \frac{1}{\lambda }{Q}_{n_1+n_2}$. By Lemma 2, the graph $G_1{\bigcup }_x{G}_2$ is an $l_1$-graph. Moreover, by Theorem 1, the convex cuts of $G_1$ and $G_2$ are still convex cuts in $G_1{\bigcup }_x{G}_2$. That is, the graph $G_1{\bigcup }_x{G}_2$ was obtained by identifying vertex x with $G_1$ and $G_2$ and performing “1-$sum$” operation will not affect the convex cut division of $G_1$ and $G_2$, then $G_1{\bigcup }_x{G}_2\to \frac{1}{\lambda }{Q}_{n_1+n_2}$. □

To facilitate the proof of the principal theorem, we give a new definition of hypergraph H. Construct a simple graph as the accompanying base graph of H, denoted by $G_H$. Such that $V\left(G_H\right)=V\left(H\right)$, two vertices are joined by one edge if and only if they lie in the same hyperedge of H.

Note 1: A clique of G is a complete subgraph of G. For any hyperedge $E_i$ in H, the vertices in $E_i$ induce a clique in $G_H$.

Note 2: Further, for any two vertices $v,u$ of H, $d_H(v,u)=d_{G_H}(v,u)$.

Below are some of the theorems of the $l_1$-embeddability of hypertrees.

Theorem 2.

Any hypertree is an $l_1$-graph. In fact, a hypertree with n vertices and m hyperedges is scale-2-embedded into the hypercube $Q_{n+m-1}$.

Proof. 

Denote the hypertree containing i hyperedges by $H{T}_i$, and denote the m hyperedges of hypertree $H{T}_m$ by $a_1,a_2,\dots ,a_m$. Suppose that the cardinality of $a_i$ is $n_i(1\le i\le m)$.

When $m=1$, the hypertree $H{T}_1$ has exactly one hyperedge. Let $a_1$ be this hyperedge, and $\left|a_1\right|=n_1$. It is obvious that the accompanying base graph of $H\left[a_1\right]$ is a complete graph. By Lemma 1, $H\left[a_1\right]=H{T}_1$ is an $l_1$-graph, and $H{T}_1\to \frac{1}{2}{Q}_{n_1}$. Since $\left|V\left(H{T}_1\right)\right|=n_1$, $\left|E\left(H{T}_1\right)\right|=1$, the hypertree $H{T}_1$ is scale-2-embeddable into a hypercube $Q_{\left|V\left(H{T}_1\right)\right|+\left|E\left(H{T}_1\right)\right|-1}=Q_{n_1+1-1}=Q_{n_1}.$

The result is clearly true for $m=1$. So assume that $m\ge 2$. We apply mathematical induction on m. Assume that the theorem is true for all hypertrees having fewer hyperedges than $H{T}_m$. If the hypertree contains $(m-1)$ hyperedges then $(m\ge 2)$. By Lemma 3, take one hanged hyperedge in hypertree $H{T}_m$ as $a_m$, such that $H{T}_{m-1}=H{T}_m-a_m$. By the inductive hypothesis, the hypertree $H{T}_{m-1}$ is an $l_1$-graph, $\left|E\left(H{T}_{m-1}\right)\right|=m-1$, and the hypertree $H{T}_{m-1}$ can be scale-2-embeddable into the hypercube $Q_{\left|V\left(H{T}_{m-1}\right)\right|+\left|E\left(H{T}_{m-1}\right)\right|-1}=Q_{\left|V\left(H{T}_{m-1}\right)\right|+(m-1)-1}=Q_{\left|V\left(H{T}_{m-1}\right)\right|+m-2}$.

Suppose that the hypertree $H{T}_m$ can be seen as a hypergraph obtained by identifying the branch vertex x from $H{T}_{m-1}$ and $a_m$. It is clear that $H{T}_m\left[a_m\right]=H{T}_1$. By the inductive hypothesis, $H{T}_{m-1}\to \frac{1}{2}{Q}_{\left|V\left(H{T}_{m-1}\right)\right|+m-2}$, $H{T}_1\to \frac{1}{2}{Q}_{n_m}$. By Lemma 2, the hypertree $H{T}_m$ is an $l_1$-graph. By Lemma 5, $H{T}_m=H{T}_{m-1}{\bigcup }_{x}H{T}_1\to \frac{1}{2}{Q}_{(\left|V\left(H{T}_{m-1}\right)\right|+m-2)+n_m}=\frac{1}{2}{Q}_{n+1+m-2}=\frac{1}{2}{Q}_{n+m-1}.$ The proof is complete by the induction assumption. □

From the above theorem, we give the $l_1$-embeddability of a special hypertree.

Corollary 1.

The k-uniform superstar $S_n^k$ is scale-2-embedded into the $Q_{\frac{k}{k-1}\times \left(n-1\right)}$.

Proof. 

It is sufficient to substitute $m=\frac{n-1}{k-1}$ into $Q_{n+m-1}$. □

The dimension of the hypercube also can be expressed in degrees as follows:

Theorem 3.

Any hypertree with m hyperedges can be scale-2-embeddable into the hypercube $Q_{1·{\lambda }_1+2·{\lambda }_2+\cdots +m·{\lambda }_m}$, where ${\lambda }_i$ is the number of i-degree vertices $(1\le i\le m)$.

Proof. 

By induction on m. Let $H{T}_i$ be a hypertree containing i hyperedges, and denote the m hyperedges of the hypertree $H{T}_m$ by $a_1,a_2,\dots ,a_m$. Suppose that the cardinality of $a_i$ is $n_i$$(1\le i\le m)$, ${\lambda }_i$ is the number of i-degree vertices of the hypertree $H{T}_m$.

When $m=1$, the hypertree $H{T}_1$ consists of only one hyperedge, say $a_1$. Let ${\eta }_i$ be the number of i-degree vertices of the hypertree $H{T}_1$. Then $\left|a_1\right|=n_1={\eta }_1$. It is obvious that the accompanying base graph of $H\left[a_1\right]$ is a complete graph, and by Lemma 1, $H\left[a_1\right]=H{T}_1$ is an $l_1$-graph, $H{T}_1\to \frac{1}{2}{Q}_{{\eta }_1}$. Hence, the hypertree $H{T}_1$ is scale-2-embeddable into the hypercube $Q_{1·{\eta }_1}=Q_{{\eta }_1}$.

Now assume that the result is true for the hypertree with $m-1$ hyperedges $(m\ge 2)$. Let ${\eta }_i^{\prime }$ be the number of i-degree vertices of the hypertree $H{T}_{m-1}$. By the inductive hypothesis, the hypertree $H{T}_{m-1}$ is an $l_1$-graph, and $H{T}_{m-1}\to \frac{1}{2}{Q}_{1·{\eta }_1^{\prime }+2·{\eta }_2^{\prime }+\cdots +(m-1)·{\eta }_{m-1}^{\prime }}$.

By Lemma 3, every hypertree with m hyperedges $(m\ge 2)$ has at least two hanged hyperedges. Take one hanged hyperedge in hypertree $H{T}_m$ as $a_m$. Suppose that the branch vertex of $a_m$ is x. Then the hypertree $H{T}_m$ can be seen as a hypergraph obtained by identifying x from $H{T}_{m-1}$ and $a_m$. It is clear that $H{T}_m\left[a_m\right]=H{T}_1$. Assume that $d_{H{T}_{m-1}}\left(x\right)=k$, $d_{H{T}_1}\left(x\right)=1$, then $d_{H{T}_m}\left(x\right)=d_{H{T}_{m-1}{\bigcup }_{x}H\left(T_1\right)}\left(x\right)=k+1$. By the inductive hypothesis, $H{T}_1\to \frac{1}{2}{Q}_{{\eta }_1}$, $H{T}_{m-1}\to \frac{1}{2}{Q}_{1·{\eta }_1^{\prime }+2·{\eta }_2^{\prime }+\cdots +(m-1)·{\eta }_{m-1}^{\prime }}$. By Lemma 2, the hypertree $H{T}_m$ is an $l_1$-graph. Then by Lemma 5, $H{T}_m=H{T}_{m-1}{\bigcup }_{x}H{T}_1\to \frac{1}{2}{Q}_{[1·{\eta }_1^{\prime }+2·{\eta }_2^{\prime }+\cdots +(m-1)·{\eta }_{m-1}^{\prime }]+(1·{\eta }_1)}=\frac{1}{2}{Q}_{1·({\eta }_1+{\eta }_1^{\prime })+2·{\eta }_2^{\prime }+\cdots +(m-1)·{\eta }_{m-1}^{\prime }}$, where ${\lambda }_1={\eta }_1+{\eta }_1^{\prime }-1,{\lambda }_2={\eta }_2+{\eta }_2^{\prime },{\lambda }_3={\eta }_3+{\eta }_3^{\prime },\cdots ,{\lambda }_k={\eta }_k+{\eta }_k^{\prime }-1,{\lambda }_{k+1}={\eta }_{k+1}+{\eta }_{k+1}^{\prime }+1,{\lambda }_{k+2}={\eta }_{k+2}+{\eta }_{k+2}^{\prime },\cdots ,{\lambda }_m={\eta }_m+{\eta }_m^{\prime }.$ Moreover,

$$\begin{array}{ccc}& & Q_{1·{\lambda }_1+2·{\lambda }_2+\cdots +m·{\lambda }_m}\hfill \\ & =& Q_{1·({\eta }_1+{\eta }_1^{\prime }-1)+2·({\eta }_2+{\eta }_2^{\prime })+\cdots +k·({\eta }_k+{\eta }_k^{\prime }-1)+(k+1)·({\eta }_{k+1}+{\eta }_{k+1}^{\prime }+1)+\cdots +m·({\eta }_m+{\eta }_m^{\prime })}\hfill \\ & =& Q_{1·({\eta }_1+{\eta }_1^{\prime })+2·({\eta }_2+{\eta }_2^{\prime })+\cdots +k·({\eta }_k+{\eta }_k^{\prime })+(k+1)·({\eta }_{k+1}+{\eta }_{k+1}^{\prime })+\cdots +m·({\eta }_m+{\eta }_m^{\prime })-1-k+(k+1)}\hfill \\ & =& Q_{1·({\eta }_1+{\eta }_1^{\prime })+2·({\eta }_2+{\eta }_2^{\prime })+\cdots +k·({\eta }_k+{\eta }_k^{\prime })+(k+1)·({\eta }_{k+1}+{\eta }_{k+1}^{\prime })+\cdots +m·({\eta }_m+{\eta }_m^{\prime })}\hfill \\ & =& Q_{1·({\eta }_1+{\eta }_1^{\prime })+2·{\eta }_2^{\prime }+\cdots +(m-1)·{\eta }_{m-1}^{\prime }}.\hfill \end{array}$$

Since $H{T}_1$ contains only one hyperedge and all vertices of $H{T}_1$ are 1-degree vertices, then ${\eta }_2={\eta }_3=\cdots ={\eta }_m=0$. Due to $H{T}_{m-1}$ containing $m-1$ hyperedges, there will be no m-degree vertices in $H{T}_{m-1}$, i.e., ${\eta }_m^{\prime }=0$. This completes the proof of the theorem. □

4. ${\mathbf{L}}_{\mathbf{1}}$-Embeddability of Unicyclic Hypergraphs

In this section, we will focus on the $l_1$-embeddability of unicyclic hypergraphs. In particular, we also study the $l_1$-embeddability of hypercycles.

In 2013, Guangfu Wang and Heping Zhang [16] introduced the gluing edge operation (“2-$sum$” operation) of two graphs. Let $G_1$ and $G_2$ be two disjoint graphs, where the edge $e_1=a_1{b}_1$ in $E\left(G_1\right)$, edge $e_2=a_2{b}_2$ in $E\left(G_2\right)$. Now identify edge $e_1$ with edge $e_2$ as a new edge $e=ab$, such that $a=a_1=a_2$ and $b=b_1=b_2$ or $a=a_1=b_2$ and $b=b_1=a_2$. We say that the resulting graph is obtained by gluing $G_1$ and $G_2$ along the edge e and denote it by $G_1{\bigcup }_e{G}_2$ or $G_1{\bigcup }_{ab}{G}_2$. They get a sufficient condition of a graph obtained from two $l_1$-graphs by gluing an edge is still an $l_1$-graph, see Lemma 6.

Lemma 6

([16]). Let $G_1$ and $G_2$ be two $l_1$-graphs. If at least one of them is bipartite, then $G_1{\bigcup }_e{G}_2$ is an $l_1$-graph.

Before proving the main theorem, we introduce a special class of graphs. Let $C_n=v_1{v}_2\cdots v_n{v}_1$ be a cycle of length n, where $n\ge 3$. Joining each vertex $v_i(i\in [1,n])$ of $C_n$ with a new $u_{ii}$ out of $C_n$ by an edge obtains a graph, called a $sungraph$ denoted as ${SC}_n$. Furthermore, for integer $k_i\ge 0(i\in [1,n])$, we join each vertex $v_i$ of $C_n$ with $k_i$ new vertices $u_{i{k}_i}$ to produce a generalized sun graph, denoted by ${GSC}_n\left(k_1,k_2,\cdots ,k_n\right)$ [24]. It is reasonable to allow some $k_i=0$, that is, no joining the vertex $v_i$ of $C_n$ with any new vertex. For instance, the generalized sun graph ${GSC}_5\left(1,2,1,3,0\right)$ is shown in Figure 1.

The line graph $L\left(G\right)$ of a graph G has vertices corresponding to the edges of G and two vertices are adjacent in $L\left(G\right)$ if their corresponding edges of G have a common end-vertex.

From the definition of the line graph, we can know that the line graph of a generalized sun graph is the graph obtained from a cycle $L\left(C_n\right)$ and n complete graphs $K_{k_i+2}(1\le i\le n)$ by the “2-$sum$” operation at their corresponding positions gradually, denoted by $L\left({GSC}_n\left(k_1,k_2,\cdots ,k_n\right)\right)$, abbreviated as $L\left({GSC}_n\right)$ [17]. For instance, the line graph of generalized sun graph $L\left({GSC}_5\left(1,2,1,3,0\right)\right)$ is shown in Figure 2.

Lemma 7

([17]). An $L\left({GSC}_n\right)$ is an $l_1$-graph.

Then, from the above lemma, we get the following theorem:

Theorem 4.

A hypercycle $H{C}_m$ with n vertices and m hyperedges is an $l_1$-graph and can scale-2-embeddable into a hypercube $Q_n$.

Proof. 

Clearly, the accompanying base graph $G_{H{C}_m}$ of hypercycle $H{C}_m$ is isomorphic to the linear graph of generalized sun graph $L\left({GSC}_m\right)$. By Lemma 7, we get that the $G_{H{C}_m}$ is an $l_1$-graph. Because for any two vertices v, u of $H{C}_m$, $d_{H{C}_m}(v,u)=d_{G_{H{C}_m}}(v,u)$. Then the hypercycle $H{C}_m$ is an $l_1$-graph.

Next, we will prove that $H{C}_m\to \frac{1}{2}{Q}_n$. Assume that the hypercycle $H{C}_m$ contains n vertices and m hyperedges. The degree of a vertex of $H{C}_m$ is either 1 or 2. Suppose that the hypercycle contains ${\lambda }_1$ vertices with degree 1 and ${\lambda }_2$ vertices with degree 2. It is clear that ${\lambda }_2=m$, ${\lambda }_1=n-m$. Let the hypercycle be $H{C}_m=\{E_1,E_2,\dots ,E_m\}$, and $E_1=\{v_1,u_1,u_1^{\prime },u_1^{″},u_1^{‴},\dots ,v_2\}$, $E_2=\{v_2,u_2,u_2^{\prime },u_2^{″},u_2^{‴},\dots ,v_3\}$, …, $E_{m-1}=\{v_{m-1},u_{m-1},u_{m-1}^{\prime },u_{m-1}^{″},u_{m-1}^{‴},\dots ,v_m\}$, $E_m=\{v_m,u_m,u_m^{\prime },u_m^{″},u_m^{‴},\dots ,v_1\}$, where $v_1,v_2,\dots ,v_m$ are the 2-degree vertices in $H{C}_m$ and $u_i,u_i^{\prime },u_i^{″},u_i^{‴},\dots (1\le i\le m)$ are the 1-degree vertices in $H{C}_m$. The hyperedge $\{v_i,u_i,u_i^{\prime },u_i^{″},u_i^{‴},\dots ,v_j\}(i+1\equiv jmod\left(m\right))$ of a hypercycle $H{C}_m$ corresponds to a complete graph of its accompanying underlying graph $G_{H{C}_m}$, denoted this complete graph by $G_i$. Therefore, $G_{H{C}_m}$ can be seen as the result obtained by the “2-sum” operation of a cycle $L\left(C_m\right)$ and m complete graphs $G_i$ at corresponding positions m times. It is clear that $G_{H{C}_m}$ is isomorphic to the linear graph of generalized sun graph $L\left({GSC}_m\right)\left(\right|V\left(G_1\right)|-2,|V\left(G_2\right)|-2,\dots ,|V\left(G_m\right)|-2)$.

We will prove the $l_1$-embeddability of hypercycle $H{C}_m$ by convex cuts. Convex cuts are constructed according to the degree of the vertices of $H{C}_m$. It is detailed in the following text.

Firstly, let’s discuss convex cuts of the first kind.

Take any vertex $u_i$ or $u_i^j(1\le i\le m,j{=}^{\prime }{,}^{″}{,}^{‴},\dots )$ of degree 1 of $H{C}_m$. Now we give a cut $\left\{A_1,B_1\right\}$, which is the vertices division of the accompanying base graph $G_{H{C}_m}$, where $A_1=\left\{u_1\right\}$, $B_1=V-A_1$. As shown in Figure 3, let $G_{11}$ be the induced subgraph of the single vertex in $A_1$, and let $G_{12}$ be the induced subgraph of the vertices in $B_1$. In the vertex set $A_1$, the shortest path from the $u_i$ to the $u_i$ is still in $G_{11}$, then $A_1$ is convex. In the vertex set $B_1$, for any two vertices $u_p,u_k\left(k\ne p\right)$, the shortest path from $u_p$ to $u_k$ is still in $G_{12}$, because $G_{12}$ is still in the form of $L\left({GSC}_m\right)$. The shortest path of any two vertices on the graph $G_{12}$ is still in $G_{12}$, (If two vertices are in the same complete graph, the distance between the two vertices is 1. Otherwise, the shortest path between two vertices must follow the m-cycle $L\left(C_m\right)$. That is, the shortest path between any two vertices is still in $G_{12}$), then $B_1$ is convex. So the cut $\left\{A_1,B_1\right\}$ is a convex cut.

Therefore, there are ${\lambda }_1$ cuts of the first kind in $G_{H{C}_m}$ that are convex cuts. Denote these convex cuts by $\left\{A_1,B_1\right\}$, $\left\{A_2,B_2\right\}$, …, $\left\{A_{n-m},B_{n-m}\right\}$. Then there exists a collection ${\mathcal{C}}_1$ of convex cuts of $G_{H{C}_m}$, such that ${\mathcal{C}}_1=\{\left\{A_1,B_1\right\},\left\{A_2,B_2\right\},\dots ,\left\{A_{n-m},B_{n-m}\right\}\}$. Moreover, the edge between $u_i$ and $u_i^j$(or $u_i^j$ and $u_i^k$)$(1\le i\le m,j,k{=}^{\prime }{,}^{″}{,}^{‴},\dots ,j\ne k)$ is cut by 2 cuts from ${\mathcal{C}}_1$, and the edge between $u_i$ and $v_i$(or $u_i^j$ and $v_i$)$(1\le i\le m,j{=}^{\prime }{,}^{″}{,}^{‴},\dots )$ is cut by 1 cut from ${\mathcal{C}}_1$.

Secondly, let us discuss convex cuts of the second kind.

(1)

When m is even, see Figure 4a. A cut $\left\{A_1^{\prime },B_1^{\prime }\right\}$ is given, which is the vertices division of the accompanying base graph $G_{H\left(C_m\right)}$, where $A_1^{\prime }=V\left(G_1-v_1\right)\cup {\sum }_{i=2}^{\frac{m}{2}}V\left(G_i\right)$, $B_1^{\prime }=V-V_1^{\prime }$. Let $G_{21}$ be the induced subgraph of the vertex in $A_1^{\prime }$. Let $G_{22}$ be the induced subgraph of the vertex in $B_1^{\prime }$. Take any two vertices in $A_1^{\prime }$, such as $v_i\in G_i$,$v_j\in G_j$ or $v_i\in G_i$,$v_{j+1}\in G_j$ or $u_i\in G_i$,$u_j^{\prime }\in G_j$ or $u_i\in G_i$,$v_j\in G_j$. The content is divided into the following two categories:

➀

If $i=j$, we have $d_{G_{21}}\left(v_i,v_j\right)=0$; $d_{G_{21}}\left(v_i,v_{j+1}\right)=1$; $d_{G_{21}}\left(u_i,u_j^{\prime }\right)=1$; $d_{G_{21}}\left(u_i,v_j\right)=1$, because for any graph $G_i\left(i=2,3,\dots ,\frac{m}{2}\right)$ or $G_1-v_1$, these graphs are still complete graphs, in which the distance between any two different vertices is 1. Moreover, the shortest path between the two different vertices in graph $G_{21}$ is still in $G_{21}$.

➁

If $i\ne j$, we have

$$d_{G_{21}}\left(v_i,v_j\right)=min\left\{\left|i-j\right|,m-\left|i-j\right|\right\};$$

$$d_{G_{21}}\left(v_i,v_{j+1}\right)=min\left\{\left|i-j\right|+1,m-\left|i-j\right|-1\right\};$$

$$d_{G_{21}}\left(u_i,u_j^{\prime }\right)=min\left\{\left|i-j\right|+1,m-\left|i-j\right|+1\right\};$$

$$d_{G_{21}}\left(u_i,v_j\right)=min\left\{\left|i-j\right|,m-\left|i-j\right|+1\right\}.$$

The shortest path of any two different vertices in graph $G_{21}$ must be along the m-cycle $L\left(C_m\right)$. So the shortest path between the two vertices of $G_{21}$ is still in $G_{21}$, and $A_1^{\prime }$ is convex.

In the same way, the shortest path between any two vertices of $G_{22}$ is still in $G_{22}$, so $B_1^{\prime }$ is convex. Then the cut $\left\{A_1^{\prime },B_1^{\prime }\right\}$ is a convex cut. Since m-cycle $L\left(C_m\right)$ is an even length cycle, the i-th convex cut $(1\le i\le \frac{m}{2})$ is repeated with the $(\frac{m}{2}+i)$-th convex cut. There are $\frac{m}{2}\left(m={\lambda }_2\right)$ convex cuts like this. Similarly, another $\frac{m}{2}$ convex cuts as shown in Figure 4b will be obtained. In fact, these two types of convex cuts appear symmetrically.

Thus, when m is even, there are ${\lambda }_2$ cuts of the second kind in $G_{H{C}_m}$ that are convex cuts. Denote these convex cuts by $\left\{A_1^{\prime },B_1^{\prime }\right\}$, $\left\{A_2^{\prime },B_2^{\prime }\right\}$, …, $\left\{A_m^{\prime },B_m^{\prime }\right\}$. Then there exists a collection ${\mathcal{C}}_2^{\prime }$ of convex cuts of $G_{H{C}_m}$, such that ${\mathcal{C}}_2^{\prime }=\{\left\{A_1^{\prime },B_1^{\prime }\right\},\left\{A_2^{\prime },B_2^{\prime }\right\},\dots ,\left\{A_m^{\prime },B_m^{\prime }\right\}\}$. Moreover, the edge between $u_i$ and $v_i$(or $u_i^j$ and $v_i$)$(1\le i\le m,j{=}^{\prime }{,}^{″}{,}^{‴},\dots )$ is cut by one cut from ${\mathcal{C}}_2^{\prime }$, and the edge between $v_i$ and $v_j$$(1\le i,j\le m)$ is cut by two cuts from ${\mathcal{C}}_2^{\prime }$.

(2)

When m is odd, see Figure 5. A cut $\left\{A_1^{″},B_1^{″}\right\}$ is given, which is the vertices division of the accompanying base graph $G_{H{C}_m}$, where $A_1^{{}^{″}}=V(G_1-v_1)\cup {\sum }_{i=2}^{\frac{m-1}{2}}V\left(G_i\right)\cup \sum \left(G_{\frac{m+1}{2}}-v_{\frac{m+1}{2}+1}\right)$, $B_1^{{}^{″}}=V-A_1^{{}^{″}}$. Let $G_{31}$ be the induced subgraph of the vertex in $A_1^{″}$. Let $G_{32}$ be the induced subgraph of the vertex in $B_1^{″}$. Taking any two vertices in graph $A_1^{″}$, such as $v_i\in G_i$, $v_j\in G_j$, or $u_i\in G_i$, $u_j^{\prime }\in G_j$, or $u_i\in G_i$, $v_j\in G_j$. The content is divided into the following two categories:

➀

If $i=j$, we have $d_{G_{31}}\left(v_i,v_j\right)=0$; $d_{G_{31}}\left(v_i,v_{j+1}\right)=1$; $d_{G_{31}}\left(u_i,u_j^{\prime }\right)=1$; $d_{G_{31}}\left(u_i,v_j\right)=1$. Because for any graph $G_i\left(i=2,3,\dots ,\frac{m-1}{2}\right)$ or $G_1-v_1$ or $G_{\frac{m+1}{2}}-v_{\frac{m+1}{2}+1}$, these graphs are still complete graphs, in which the distance between any two different vertices is 1. Moreover, the shortest path between the two different vertices in graph $G_{31}$ is still in $G_{31}$.

➁

If $i\ne j$, we have

$$d_{G_{31}}\left(v_i,v_j\right)=min\left\{\left|i-j\right|,m-\left|i-j\right|\right\};$$

$$d_{G_{31}}\left(v_i,v_{j+1}\right)=min\left\{\left|i-j\right|+1,m-\left|i-j\right|-1\right\};$$

$$d_{G_{31}}\left(u_i,u_j^{\prime }\right)=min\left\{\left|i-j\right|+1,m-\left|i-j\right|+1\right\};$$

$$d_{G_{31}}\left(u_i,v_j\right)=min\left\{\left|i-j\right|,m-\left|i-j\right|+1\right\}.$$

The shortest path of any two different vertices in graph $G_{31}$ must be along the m-cycle $L\left(C_m\right)$. So the shortest path between the two vertices of $G_{31}$ is still in $G_{31}$, then $A_1^{″}$ is convex. In the same way, the shortest path between any two vertices of $G_{32}$ is still in $G_{32}$, so $B_1^{″}$ is convex. Then the cut $\left\{A_1^{″},B_1^{″}\right\}$ is a convex cut.

Since m-cycle $L\left(C_m\right)$ is an odd length cycle, there are $m\left(m={\lambda }_2\right)$ convex cuts like this. So when m is odd, there are ${\lambda }_2$ cuts of the second kind in $G_{H{C}_m}$ that are convex cuts. Denote these convex cuts by $\left\{A_1^{″},B_1^{″}\right\}$, $\left\{A_2^{″},B_2^{″}\right\}$, …, $\left\{A_m^{″},B_m^{″}\right\}$. Then there exists a collection ${\mathcal{C}}_2^{″}$ of convex cuts of $G_{H{C}_m}$, such that ${\mathcal{C}}_2^{″}=\{\left\{A_1^{″},B_1^{″}\right\},\left\{A_2^{″},B_2^{″}\right\},\dots ,\left\{A_m^{″},B_m^{″}\right\}\}$. In fact, these convex cuts all appear symmetrically. Moreover, the edge between $u_i$ and $v_i$(or $u_i^j$ and $v_i$) $(1\le i\le m,j{=}^{\prime }{,}^{″}{,}^{‴},\dots )$ is cut by one cut from ${\mathcal{C}}_2^{″}$, and the edge between $v_i$ and $v_j$$(1\le i,j\le m)$ is cut by two cuts from ${\mathcal{C}}_2^{″}$.

Consequently, all the ${\lambda }_2$ cuts of the second kind in $G_{H{C}_m}$ are convex cuts.

Therefore, in the accompanying base graph $G_{H{C}_m}$ of the hypercycle $H{C}_m$, there are ${\lambda }_1+{\lambda }_2=n$ convex cuts, which can form a convex cut cluster $\mathcal{C}={\mathcal{C}}_1+{\mathcal{C}}_2^{\prime }$ or $\mathcal{C}={\mathcal{C}}_1+{\mathcal{C}}_2^{″}$. By Lemma 1, each edge of the accompanying base graph $G_{H{C}_m}$ is cut by exactly two cuts from $\mathcal{C}$, so the graph $G_{H{C}_m}$ can scale-2-embeddable into a hypercube $Q_n$. Because for any two vertices v, u of $H{C}_m$, $d_{H{C}_m}(v,u)=d_{G_{H{C}_m}}(v,u)$. Then the hypercycle $H{C}_m$ can scale-2-embeddable into a hypercube $Q_n$. □

Finally, we study the $l_1$-embeddability of unicyclic hypergraphs. Given a unicyclic hypergraph $H{U}_m$, where n is the number of vertices, m is the number of hyperedges, $n_1$ is the number of vertices contained in a single cycle in the unicyclic hypergraph, $m_1$ is the number of edges contained in a single cycle in the unicyclic hypergraph, $m^{\prime }$ is the number of edges other than the number of edges contained in a single cycle. It is clear that $m^{\prime }=m-m_1$. Then we have:

Theorem 5.

Any unicyclic hypergraph is an $l_1$-graph. In fact, a unicyclic hypergraph with n vertices and m hyperedges is scale-2-embedded into a hypercube $Q_{n+m^{\prime }}=Q_{n+m-m_1}$.

Proof. 

The unicyclic hypergraph $H{U}_m$ is obtained by gradually using “1-$sum$” operation between the hypercycle $H{C}_m$ and some hyperedges. For any hyperedge $E_i$ in hypergraph H, the vertices in $E_i$ induce a clique in $G_H$. By Lemma 1, $H\left[E_i\right]$ is an $l_1$-graph. Combining Theorem 4 and Lemma 2, we know that any unicyclic hypergraph is an $l_1$-graph.

Next, we will prove that $H{U}_m\to \frac{1}{2}{Q}_{n+m^{\prime }}=\frac{1}{2}{Q}_{n+m-m_1}$. Suppose that a unicyclic hypergraph with n vertices and m hyperedges is $H{U}_m$. Assume that the number of vertices contained in a single hypercycle is $n_1$ and the number of hyperedges is $m_1$, where $m^{\prime }=m-m_1$. We prove the result by mathematical induction on m.

(1)

Assume that a unicyclic hypergraph $H{U}_m$ has no hanged hyperedges. Without loss of generality, at this time, any unicyclic hypergraph $H{U}_m$ is a hypercycle $H{C}_m$, then $H{U}_m=H{C}_m$, $\left|V\left(H{U}_m\right)\right|=n_1,\left|E\left(H{U}_m\right)\right|=m=m_1$, $m^{\prime }=m-m_1=0$. By Theorem 4, a unicyclic hypergraph $H{U}_m$ is an $l_1$-graph and $H{U}_m\to \frac{1}{2}{Q}_{n_1}$. Hence, a unicyclic hypergraph $H{U}_m$ without hanged hyperedges can be scale-2-embeddable into a hypercube $Q_{n_1+m^{\prime }}=Q_{n_1+m_1-m_1}=Q_{n_1}$.

(2)

When a unicyclic hypergraph contains hanged hyperedges. If the unicyclic hypergraph contains a hanged hyperedge. Let $a_1$ be the hanged hyperedge, and let $H{C}_m+a_1$ be the unicyclic hypergraph. By Lemma 2, $H{C}_m+a_1\to \frac{1}{2}{Q}_{n+|a_1|}$. Hence, the unicyclic hypergraph $H{C}_m+a_1$ is scale-2-embedded into a hypercube $Q_{(n_1+|a_1|-1)+(m_1+1)-m_1}=Q_{n+|a_1|}$.

The result can be verified for a unicyclic hypergraph containing a hanged hyperedge. Hence, suppose that the result is true for a unicyclic hypergraph containing more than one hanged hyperedges. Assume that a unicyclic hypergraph contains $m^{\prime }$ hanged hyperedges, then the unicyclic hypergraph is $H{U}_m$. By inductive assumptions, any unicyclic hypergraph is an $l_1$-graph and $H{U}_m\to \frac{1}{2}{Q}_{n+m-m_1}$.

When a unicyclic hypergraph contains $m^{\prime }+1$ hanged hyperedges, obviously, denoted this unicyclic hypergraph by $H{U}_{m+1}$. Denoted the hanged hyperedge added to unicyclic hypergraph $H{U}_m$ by $a_m$. By Lemma 2, $H{U}_{m+1}=H{U}_m+a_m\to \frac{1}{2}{Q}_{(n+m-m_1)+\left|a_m\right|}=\frac{1}{2}{Q}_{n+m-m_1+\left|a_m\right|}$. Moreover, $Q_{\left|V\left(H{U}_{m+1}\right)\right|+(m+1)-m_1}=Q_{(n+|a_m|-1)+(m+1)-m_1}=Q_{n+m-m_1+\left|a_m\right|}$. Hence, the result is true. □

5. Applications

According to the inspiration of applying graph theory knowledge to real life [25,26], the hypergraph studied in this paper also has many applications. The distance-based topological indices of many molecules (such as the Wiener index, Szeged index, PI index, etc.) are closely related to their physical and chemical properties [27,28]. We already know that the distance between any two vertices in a hypercube graph is exactly equal to the number of different positions representing the array of the two vertices [29]. If a hypergraph is an $l_1$-graph, we can easily get the distance between any two vertices in the hypergraph, and then we can further calculate its various indices. Here is a simple example to find the Erd$\ddot{o}$s number for any author.

Now we give ten authors. If several authors work together to write an article, these authors will form a hyperedge. According to this principle, the relation of these authors is shown in Figure 6, forming a unicyclic hypergraph $H{U}_4$, where $n=10$, $m=4$, and $m_1=3$. The question is to find the Erd$\ddot{o}$s number for any author.

By Theorem 5, this hypergraph $H{U}_4$ is scale-2-embedded into a hypercube $Q_{n+m-m_1}=Q_{10+4-3}=Q_{11}$. Next, we get the accompanying base graph $G_{H{U}_4}$ of this hypergraph, see Figure 7. According to the vertex label of the hypercube graph [14], each vertex of the accompanying base graph $G_{H{U}_4}$ is labeled, as shown in Figure 7.

By observing the vertex labels of Wang and Erd$\ddot{o}$s, it can be found that the labels of these two vertices are different in four positions, so the distance between Wang and Erd$\ddot{o}$s in $Q_{11}$ is 4. Since this hypergraph $H{U}_4\to \frac{1}{2}{Q}_{11}$, then the Erd$\ddot{o}$s number of Wang is $\frac{2}{4}=2$.

By observing the vertex labels of Chen and Erd$\ddot{o}$s, it can be found that the labels of these two vertices are different in four positions, so the distance between Chen and Erd$\ddot{o}$s in $Q_{11}$ is 2. Since this hypergraph $H{U}_4\to \frac{1}{2}{Q}_{11}$, then the Erd$\ddot{o}$s number of Chen is $\frac{2}{2}=1$. According to this method, we can find the Erd$\ddot{o}$s number of any author.

6. Conclusions

In this paper, we mainly examine the $l_1$-embeddability of hypertrees and unicyclic hypergraphs. We found that a hypertree with n vertices and m hyperedges is scale-2-embedded into the hypercube $Q_{n+m-1}$. Considering the degree of the vertices, any hypertree with m hyperedges can be scale-2-embeddable into the hypercube $Q_{1·{\lambda }_1+2·{\lambda }_2+\cdots +m·{\lambda }_m}$. Specially, we show that a hypercycle with n vertices and m hyperedges is an $l_1$-graph and can scale-2-embeddable into a hypercube $Q_n$. In addition, a unicyclic hypergraph with n vertices and m hyperedges is scale-2-embedded into a hypercube $Q_{n+m-m_1}$. It has a profound significance for simplifying the calculation of the distance between two vertices of a hypergraph, and it will also have a wide and profound impact on chemical, physical and electronic information.