English

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

Combinatorics 2017-04-21 v1

Abstract

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

Keywords

Cite

@article{arxiv.1704.06002,
  title  = {The minimum Q-index of strongly connected bipartite digraphs with complete bipartite subdigraphs},
  author = {Weige Xi and Ligong Wang},
  journal= {arXiv preprint arXiv:1704.06002},
  year   = {2017}
}

Comments

11 pages, 2 figures