Extremal digraphs with given clique number

DOI10.1016/J.LAA.2013.03.024MaRDI QIDQ2637154zbMATH OpenOpenAlexFDO

Authors Huiqiu Lin, S. W. Drury

Publication date 19 February 2014

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2013.03.024

zbMATH Keywords

characteristic polynomialclique numberdigraphPerron roottournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15)

Cites work

• Bounds on graph eigenvalues. II
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Matrix Analysis
• Pick's inequality and tournaments
• Solution of the conjecture of Brualdi and Li
• Some Inequalities for the Largest Eigenvalue of a Graph
• Spectra of digraphs
• Spectral radius of strongly connected digraphs

Cited in

(5)

• The \(A_{\alpha}\) spectral radius characterization of some digraphs
• Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
• On the spectral radius of simple digraphs with prescribed number of arcs
• Sizes and transmissions of digraphs with a given clique number
• On the A_ spectral radius of digraphs with given parameters

This page was built for publication: Extremal digraphs with given clique number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637154)