Search

Your search keyword '"Huang, Qiongxiang"' showing total 278 results
Start Over Author "Huang, Qiongxiang"
278 results on '"Huang, Qiongxiang"'

65. The maximal Aα-spectral radius of graphs with given matching number.

Author

Chen, Qianqian and Huang, Qiongxiang

Subjects
*LINEAR algebra, *LINEAR orderings, *LAPLACIAN matrices
Abstract

Let G n , β be the set of simple graphs of order n with given matching number β. In this paper, we characterize the extremal graphs with maximal A α -spectral radius in G n , β for 0 ≤ α < 1 , which generalizes the results for adjacency matrix in [Feng L, Yu G, Zhang X-D. Spectral radius of graphs with given matching number. Linear Algebra Appl. 2007;422:133–138, Theorem 1.1] and signless Laplacian matrix in [Yu G. On the maximal signless Laplacian spectral radius of graphs. Proc Japan Acad Ser A. 2018, Theorem 2.5]. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

74. On 2-equitable graphs.

Author

Lu, Lu, Huang, Qiongxiang, and Feng, Lihua

Subjects
*KILLER cells, *CHARTS, diagrams, etc., *EIGENVALUES, *REGULAR graphs
Abstract

Let Π be an equitable partition of a graph G with k cells. If G has no equitable partition with fewer cells than Π, then Π is called a minimal partition of G and G is called a k-equitable graph. It is clear that 1-equitable graphs are regular graphs. In this paper, we investigate 2-equitable graphs with four distinct eigenvalues. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

76. Relational to XML Schema Conversion with Constraints

Author

Lv, Teng, Yan, Ping, Huang, Qiongxiang, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Grumbach, Stéphane, editor, Sui, Liying, editor, and Vianu, Victor, editor

Published
2005
Full Text
View/download PDF

83. Distance eigenvalues of B(n, k).

Author

Lu, Lu and Huang, Qiongxiang

Subjects
*EIGENVALUES, *DISTANCES, *REGULAR graphs, *DIAMETER
Abstract

Let B (n , k) be the subgraph of the Boolean lattice B L n induced by the kth and (k + 1) th layers. The distance spectrum of B L n was obtained by Aalipour et al. and Koolen et al. proved that B L n is determined by its distance spectrum. In this paper, we introduce a new method to verify that a quotient matrix contains all distance eigenvalues of a graph, and we get the distance spectrum of B (n , k) by using this method. It is proved that B (n , k) has exactly four distinct distance eigenvalues, and its diameter can be arbitrarily large. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results