Search Results - "Pan, Yingui"

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    Spectral Radius and Fractional Perfect Matchings in Graphs by Pan, Yingui, Liu, Chang

    Published in Graphs and combinatorics (01-06-2023)
    “…For an n -vertex graph G , a fractional matching of G is a function f giving each edge a real number in [0, 1] such that ∑ e ∈ Γ ( v ) f ( e ) ≤ 1 for each…”
    Get full text
    Journal Article
  2. 2

    Bounding the total forcing number of graphs by Ji, Shengjin, He, Mengya, Li, Guang, Pan, Yingui, Zhang, Wenqian

    Published in Journal of combinatorial optimization (01-11-2023)
    “…In recent years, a dynamic coloring, named as zero forcing, of the vertices in a graph have attracted many researchers. For a given G and a vertex subset S ,…”
    Get full text
    Journal Article
  3. 3
  4. 4

    Kirchhoff index, multiplicative degree‐Kirchhoff index and spanning trees of the linear crossed hexagonal chains by Pan, Yingui, Li, Jianping

    Published in International journal of quantum chemistry (15-12-2018)
    “…Let Hn be a linear crossed hexagonal chain with n crossed hexagonals. In this article, we find that the Laplacian (resp. normalized Laplacian) spectrum of Hn…”
    Get full text
    Journal Article
  5. 5

    On the geometric-arithmetic Estrada index of graphs by Liu, Chang, Pan, Yingui, Li, Jianping

    Published in Applied mathematics and computation (15-02-2021)
    “…•A novel eigenvalue-based topological index, namely the geometric-arithmetic Estrada index, is proposed based on the geometric-arithmetic matrix and the…”
    Get full text
    Journal Article
  6. 6

    Kirchhoff Indices and Numbers of Spanning Trees of Molecular Graphs Derived from Linear Crossed Polyomino Chain by Pan, Yingui, Liu, Chang, Li, Jianping

    Published in Polycyclic aromatic compounds (02-01-2022)
    “…Polyomino systems are widely studied in organic chemistry, especially in polycyclic aromatic compounds. Let Q n be a linear crossed polyomino chain with n…”
    Get full text
    Journal Article
  7. 7

    Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star by Li, Zhemin, Xie, Zheng, Li, Jianping, Pan, Yingui

    Published in Applied mathematics and computation (01-10-2020)
    “…•In this paper, we consider the resistance distance-based graph invariants and spanning trees of the graph S2n derived from the strong prism of a star. We…”
    Get full text
    Journal Article
  8. 8

    On the Laplacian Spectrum and Kirchhoff Index of Generalized Phenylenes by Liu, Chang, Pan, Yingui, Li, Jianping

    Published in Polycyclic aromatic compounds (21-10-2021)
    “…Hexagonal and quadrilateral structures are very common in the molecular structure of organic chemistry, especially in polycyclic aromatic compounds. Let L n be…”
    Get full text
    Journal Article
  9. 9

    On the normalized Laplacians with some classical parameters involving graph transformations by Pan, Yingui, Li, Jianping, Li, Shuchao, Luo, Wenjun

    Published in Linear & multilinear algebra (02-08-2020)
    “…Given a connected graph G, two types of graph transformations on G are considered. The graph is obtained by applying the first transformation on G, i.e. it is…”
    Get full text
    Journal Article
  10. 10

    Resistance distance-based graph invariants and spanning trees of graphs derived from the strong product of $P_2$ and $C_n by Pan, Yingui, Li, Jianping

    Published 10-06-2019
    “…Let $G_n$ be a graph obtained by the strong product of $P_2$ and $C_n$, where $n\geqslant3$. In this paper, explicit expressions for the Kirchhoff index,…”
    Get full text
    Journal Article
  11. 11

    Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains by Pan, Yingui, Li, Jianping

    Published 16-05-2019
    “…Let $G_n$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative…”
    Get full text
    Journal Article
  12. 12

    Signless Laplacian spectral radius and fractional matchings in graphs by Pan, Yingui, Li, Jianping

    Published 16-05-2019
    “…A fractional matching of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ such that $\sum_{e\in\Gamma(v)}f(e)\leq1$ for each vertex $v\in…”
    Get full text
    Journal Article
  13. 13

    Signless Laplacian spectral radius and matching in graphs by Liu, Chang, Pan, Yingui, Li, Jianping

    Published 08-07-2020
    “…The signless Laplacian matrix of a graph $G$ is given by $Q(G)=D(G)+A(G)$, where $D(G)$ is a diagonal matrix of vertex degrees and $A(G)$ is the adjacency…”
    Get full text
    Journal Article