Search arXivSearch

arXiv · 1804.08808

The $(p,q)$-spectral radii of $(r,s)$-directed hypergraphs

Abstract

An $(r,s)$-directed hypergraph is a directed hypergraph with $r$ vertices in tail and $s$ vertices in head of each arc. Let $G$ be an $(r,s)$-directed hypergraph. For any real numbers $p$, $q\geq 1$, we define the $(p,q)$-spectral radius $λ_{p,q}(G)$ as \[ λ_{p,q}(G):=\max_{||{\bf x}||_p=||{\bf y}||_q=1} \sum_{e\in E(G)}\Bigg(\prod_{u\in T(e)}x_u\Bigg)\Bigg(\prod_{v\in H(e)}y_v\Bigg), \] where ${\bf x}=(x_1, \ldots, x_m)^{\rm T}$, ${\bf y}=(y_1,\ldots, y_n)^{\rm T}$ are real vectors; and $T(e)$, $H(e)$ are the tail and head of arc $e$, respectively. We study some properties about $λ_{p,q}(G)$ including the bounds and the spectral relation between $G$ and its components. The $α$-normal labeling method for uniform hypergraphs was introduced by Lu and Man in 2014. It is an effective method in studying the spectral radii of uniform hypergraphs. In this paper, we develop the $α$-normal labeling method for calculating the $(p,q)$-spectral radii of $(r,s)$-directed hypergraphs. Finally, some applications of $α$-normal labeling method are given.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lele Liu, Linyuan Lu. 2018-04-24. The $(p,q)$-spectral radii of $(r,s)$-directed hypergraphs. https://arxiv.org/abs/1804.08808

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO