pith. sign in

arxiv: 1704.06002 · v1 · pith:75AXBQYAnew · submitted 2017-04-20 · 🧮 math.CO

The minimum Q-index of strongly connected bipartite digraphs with complete bipartite subdigraphs

classification 🧮 math.CO
keywords bipartiteq-indexcompleteconnecteddigraphsmathcalminimumstrongly
0
0 comments X
read the original abstract

Let $\mathcal{G}_{n,p,q}$ denote the set of strongly connected bipartite digraphs on $n$ vertices which contain a complete bipartite subdigraph $\overleftrightarrow{K_{p,q}}$, where $p, q, n$ are positive integers and $p+q \leq n$. In this paper, we study the Q-index (i.e. the signless Laplacian spectral radius) of $\mathcal{G}_{n,p,q}$, and determine the extremal digraph that has the minimum Q-index.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.