2 citations · 3 across the 23 of their papers we have counts for
24 papers
Some results on extremal spectral radius of hypergraph
Guanglong Yu
For a with a nonempty vertex set and an edge set , its $\mathcal {A}_{\mathcal{G}}=[(\ma…
The unicyclic hypergraph with extremal spectral radius
Guanglong Yu, Lin Sun
For a consisting of a nonempty vertex set and an edge set , its $\mathcal {A}_{\mathcal{…
The uniform supertrees with the extremal spectral radius
Guanglong Yu, Lin Sun
For a consisting of a nonempty vertex set and an edge set , its $\mathcal {A}_{\mathcal{…
Bijections for Ranked Tree-Child Networks
Alessandra Caraceni, Michael Fuchs, Guan-Ru Yu
The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lamb…
Counting Phylogenetic Networks with Few Reticulation Vertices: A Second Approach
Michael Fuchs, En-Yu Huang, Guan-Ru Yu
Tree-child networks, one of the prominent network classes in phylogenetics, have been introduced for the purpose of modeling reticulate evolution. Recently, the first author togeth…
On the Ky Fan -norm of the -matrix of graphs
Zhen Lin, Lianying Miao, Guanglong Yu +1
Let and be the adjacency matrix and the degree diagonal matrix of a graph , respectively. Then is called Laplacian matrix of the graph . Let $G…
Asymptotic Enumeration and Distributional Properties of Galled Networks
Michael Fuchs, Guan-Ru Yu, Louxin Zhang
We show a first-order asymptotics result for the number of galled networks with leaves. This is the first class of phylogenetic networks of {\it large} size for which an asympt…
Expected number of pattern and submap occurrences in random planar maps
Guan-Ru Yu
Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper…
Universal singular exponents in catalytic variable equations
Michael Drmota, Marc Noy, Guan-Ru Yu
Catalytic equations appear in several combinatorial applications, most notably in the numeration of lattice path and in the enumeration of planar maps. The main purpose of this pap…
On the Asymptotic Growth of the Number of Tree-Child Networks
Michael Fuchs, Guan-Ru Yu, Louxin Zhang
In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with leaves has the factor in its main asymptotic growth term. In…
A note on algebraic connectivity of 2-connected graphs
Guanglong Yu, by Shuguang Guo, Lin Sun +2
Among all simple 2-connected graphs, and among all -graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.
Least -eigenvalues of nonbipartite 2-connected graphs
Guanglong Yu, by Lin Sun, Chao Yan +2
Among all simple nonbipartite 2-connected graphs and among all nonbipartite -graphs, the minimum least -eigenvalues are completely determined, respectively.
On the spectral radii of the unicyclic hypergraphs with fixed matching number
Guanglong Yu, Chao Yan, Yarong Wu +1
We determine the unique hypergraphs with maximum spectral radius among all connected -uniform () unicyclic hypergraphs with matching number at least , and among all…
Further results on the least Q-eigenvalue of a graph with fixed domination number
Guanglong Yu, Yarong Wu, Mingqing Zhai
In this paper, we proceed on determining the minimum among the connected nonbipartite graphs on vertices and with domination number $\frac{n+1}{3}<γ\leq \frac{n…
The domination number and the least Q-eigenvalue II
Guanglong Yu
Denote by the obtained by attaching a pendant path () to a cycle $\mathbb{C}=v_{1}v_{2}\cdots v_{g}v_…
Infection in Hypergraphs
Ryan Bergen, Shaun Fallat, Adam Gorr +5
In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infecti…
Distance and distance signless Laplacian spread of connected graphs
Lihua You, Liyong Ren, Guanglong Yu
For a connected graph on vertices, recall that the distance signless Laplacian matrix of is defined to be , where …
Exponents of the primitive Boolean matrices with fixed girth
Guanglong Yu
The of a primitive Boolean matrix is defined to be the of its associated digraph. In this paper, among all primitive Boolean matrices of order , the primitive ex…
Maxima of the signless Laplacian spectral radius for planar graphs
Guanglong Yu
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph has the maximal…
On the local base set of primitive and nonpowerful signed digraphs
Guanglong Yu, Zhengke Miao
In this paper, we consider the local bases of primitive nonpowerful sign pattern matrices, show that there are "gaps" in the local base set and characterize some sign pattern matri…
Maxima of the -index for outer-planar graphs
Guanglong Yu
The - of graph is the largest eigenvalue of its signless Laplacian . In this paper, we prove that the graph has the maximal -ind…
A lower bound of the least signless Laplacian eigenvalue of a graph
Shu-Guang Guo, Yong-Gao Chen, Guanglong Yu
Let be a simple connected graph on vertices and edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalu…
Distance spectral radius of a tree with given diameter
Guanglong Yu, Shuguang Guo, Mingqing Zhai
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the tree…
The domination number and the least -eigenvalue
Guanglong Yu, Shu-Guang Guo, Rong Zhang +1
A vertex set of a graph is said to be a dominating set if every vertex of is adjacent to at least a vertex in , and the domination number (,…