Xiao-Dong Zhang

Discret. Math., 2025

Bounds for the incidence Q-spectral radius of uniform hypergraphs.

[BibT_eX]

[DOI]

Peng-Li Zhang

Appl. Math. Comput., 2025

2024

A note on median eigenvalues of subcubic graphs.

[BibT_eX]

[DOI]

Yuzhenni Wang

Discret. Appl. Math., January, 2024

A class of trees determined by their chromatic symmetric functions.

[BibT_eX]

[DOI]

Yuzhenni Wang

Xingxing Yu

Discret. Math., 2024

2023

On generalized distance spectral radius and generalized distance energy of graphs.

[BibT_eX]

[DOI]

Zia Ullah Khan

Discret. Math. Algorithms Appl., November, 2023

The extremal average distance of cubic graphs.

[BibT_eX]

[DOI]

Yi-ze Chen

Xin Li

J. Graph Theory, August, 2023

On the Aα-spectral radius of graphs without linear forests.

[BibT_eX]

[DOI]

A-Ming Liu

Appl. Math. Comput., August, 2023

2022

On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees.

[BibT_eX]

[DOI]

Inf. Comput., 2022

On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues.

[BibT_eX]

[DOI]

Yuzhenni Wang

Discret. Math., 2022

On $D_{\alpha}$ spectrum of connected graphs.

[BibT_eX]

[DOI]

Zia Ullah Khan

Contributions Discret. Math., 2022

On the combinatorics of derangements and related permutations.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2022

2021

Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Turán numbers for disjoint paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

The Hitting Times of Random Walks on Bicyclic Graphs.

[BibT_eX]

[DOI]

Xiaomin Zhu

Graphs Comb., 2021

On the spectral radius of graphs without a star forest.

[BibT_eX]

[DOI]

A-Ming Liu

Discret. Math., 2021

On the eccentric subtree number in trees.

[BibT_eX]

[DOI]

Xiu-Mei Zhang

Discret. Appl. Math., 2021

Extreme Wiener indices of trees with given number of vertices of maximum degree.

[BibT_eX]

[DOI]

Vladimir Bozovic

Zana Kovijanic Vukicevic

Goran Popivoda

Rong-Ying Pan

Discret. Appl. Math., 2021

Variations of the eccentricity and their properties in trees.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Wiener index of unicycle graphs with given number of even degree vertices.

[BibT_eX]

[DOI]

Peter Luo

Cun-Quan Zhang

Discret. Math. Algorithms Appl., 2020

The normality and sum of normalities of trees.

[BibT_eX]

[DOI]

Discret. Math., 2020

The expected subtree number index in random polyphenylene and spiro chains.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

The Maximum Spectral Radius of Graphs Without Friendship Subgraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Spectral Extremal Results with Forbidding Linear Forests.

[BibT_eX]

[DOI]

A-Ming Liu

Graphs Comb., 2019

Extremal trees with respect to the Steiner Wiener index.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2019

Erdős-Gallai stability theorem for linear forests.

[BibT_eX]

[DOI]

Discret. Math., 2019

Extremal graphs for vertex-degree-based invariants with given degree sequences.

[BibT_eX]

[DOI]

Muhuo Liu

Kexiang Xu

Discret. Appl. Math., 2019

Block-Circulant Inverse Orthogonal Jacket Matrices and Its Applications to the Kronecker MIMO Channel.

[BibT_eX]

[DOI]

Han Hai

Circuits Syst. Signal Process., 2019

The Steiner Wiener index of trees with a given segment sequence.

[BibT_eX]

[DOI]

Jie Zhang

Appl. Math. Comput., 2019

Multi-distance granularity structural α-subtree index of generalized Bethe trees.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

Spectral Analysis.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

The number of edges, spectral radius and Hamilton-connectedness of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs.

[BibT_eX]

[DOI]

Ya-Lei Jin

Discret. Math. Algorithms Appl., 2018

Peripheral Wiener index of trees and related questions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Estimating the number of weak balance structures in signed networks.

[BibT_eX]

[DOI]

Yinghong Ma

Commun. Nonlinear Sci. Numer. Simul., 2018

On majorization of closed walk vectors of trees with given degree sequences.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

A Variation of the Erdős-Sós Conjecture in Bipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

The Turán number of disjoint copies of paths.

[BibT_eX]

[DOI]

Discret. Math., 2017

On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Note on extremal graphs with given matching number.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

2016

Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree.

[BibT_eX]

[DOI]

Ya-Lei Jin

Yeong-Nan Yeh

J. Comb. Optim., 2016

Ordering connected graphs by their Kirchhoff indices.

[BibT_eX]

[DOI]

Kexiang Xu

Kinkar Chandra Das

Int. J. Comput. Math., 2016

Maximum atom-bond connectivity index with given graph parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On (Super) Vertex-Graceful Labeling Of Graphs.

[BibT_eX]

Zhen-Bin Gao

Lijuan Xu

Ars Comb., 2016

Construction of multiple-rate quasi-cyclic LDPC codes with girth eight.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Wireless Communications & Signal Processing, 2016

Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computer, 2016

2015

The Minimal Number of Subtrees with a Given Degree Sequence.

[BibT_eX]

[DOI]

Xiu-Mei Zhang

Graphs Comb., 2015

On the spectral radius of simple digraphs with prescribed number of arcs.

[BibT_eX]

[DOI]

Ya-Lei Jin

Discret. Math., 2015

The second Zagreb indices of graphs with given degree sequences.

[BibT_eX]

[DOI]

Weigang Yuan

Discret. Appl. Math., 2015

The Terminal Wiener Index of Trees with Diameter or Maximum Degree.

[BibT_eX]

Ars Comb., 2015

2014

Spectral Analysis.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

Algebraic Cayley graphs over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2014

Fast parametric reciprocal-orthogonal jacket transforms.

[BibT_eX]

[DOI]

Xueqin Jiang

EURASIP J. Adv. Signal Process., 2014

2013

The Number of Subtrees of Trees with Given Degree Sequence.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

2012

Fast Reciprocal Jacket Transform With Many Parameters.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2012

Automorphism groups of the Pancake graphs.

[BibT_eX]

[DOI]

Yun-Ping Deng

Inf. Process. Lett., 2012

Kotzig frames and circuit double covers.

[BibT_eX]

[DOI]

Cun-Quan Zhang

Discret. Math., 2012

The weighted tunable clustering in local-world networks with incremental behaviors

[BibT_eX]

[DOI]

Yinghong Ma

Huijia Li

CoRR, 2012

Nodal domain partition and the number of communities in networks

[BibT_eX]

[DOI]

Bian He

Lei Gu

CoRR, 2012

The Wiener Index of Unicyclic Graphs with Girth and Matching Number.

[BibT_eX]

Ars Comb., 2012

2011

Vertex degrees and doubly stochastic graph matrices.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Two Sharp Upper Bounds for the signless Laplacian spectral radius of Graphs.

[BibT_eX]

[DOI]

Rong-Ying Pan

Discret. Math. Algorithms Appl., 2011

The Laplacian Spectra of Graphs and Complex Networks

[BibT_eX]

[DOI]

Rong-Ying Pan

CoRR, 2011

Automorphism Group of the Derangement Graph.

[BibT_eX]

[DOI]

Yun-Ping Deng

Electron. J. Comb., 2011

A Note on Eigenvalues of the Derangement Graph.

[BibT_eX]

Yun-Ping Deng

Ars Comb., 2011

2009

Odd Graceful Labelings of Graphs.

[BibT_eX]

[DOI]

Zhen-Bin Gao

Lijuan Xu

Discret. Math. Algorithms Appl., 2009

The signless Laplacian spectral radius of graphs with given degree sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

The Laplacian spectral radii of trees with degree sequences.

[BibT_eX]

[DOI]

Discret. Math., 2008

Jacket transform eigenvalue decomposition.

[BibT_eX]

[DOI]

Nikolai L. Manev

Appl. Math. Comput., 2008

2007

Fast Block Center Weighted Hadamard Transform.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2007

Spectral radii of graphs with given chromatic number.

[BibT_eX]

[DOI]

Lihua Feng

Qiao Li

Appl. Math. Lett., 2007

2005

Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees.

[BibT_eX]

[DOI]

Yuan Hong

Discret. Math., 2005

Doubly stochastic matrices of trees.

[BibT_eX]

[DOI]

Jia-Xi Wu

Appl. Math. Lett., 2005

2004

Disjoint Triangles of a Cubic Line Graph.

[BibT_eX]

[DOI]

Stanislaw Bylka

Graphs Comb., 2004

Bipartite graphs with small third Laplacian eigenvalue.

[BibT_eX]

[DOI]

Discret. Math., 2004

On the Laplacian Spectra of Graphs.

[BibT_eX]

Ars Comb., 2004

2003

The Equality Cases for the Inequalities of Fischer, Oppenheim, and Ando for General M-Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2003

A New Class of Inverse M-Matrices of Tree-Like Type.

[BibT_eX]

[DOI]

Servet Martínez

Jaime San Martín

SIAM J. Matrix Anal. Appl., 2003

Graphs with fourth Laplacian eigenvalue less than two.

[BibT_eX]

[DOI]

Eur. J. Comb., 2003

Bipartite density of cubic graphs.

[BibT_eX]

[DOI]

Abraham Berman

Discret. Math., 2003

2002

The spectral radius of triangle-free graphs.

[BibT_eX]

[DOI]

Rong Luo

Australas. J Comb., 2002

2001

On the Spectral Radius of Graphs with Cut Vertices.

[BibT_eX]

[DOI]

Abraham Berman

J. Comb. Theory B, 2001

1997

An efficient and reconfigurable VLSI architecture for different block matching motion estimation algorithms.

[BibT_eX]

[DOI]