The minimum Q-index of strongly connected bipartite digraphs with complete bipartite subdigraphs
Abstract
Let Gn,p,q denote the set of strongly connected bipartite digraphs on n vertices which contain a complete bipartite subdigraph Kp,q, where p, q, n are positive integers and p+q ≤ n. In this paper, we study the Q-index (i.e. the signless Laplacian spectral radius) of Gn,p,q, and determine the extremal digraph that has the minimum Q-index.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.