2025
The Laplacian characteristic polynomial of the path-tree of the complete graph.
Discret. Appl. Math., 2025
K4-free planar minimal bricks with the maximum number of edges.
Discret. Appl. Math., 2025
On saturated non-covered graphs.
Discret. Appl. Math., 2025
On the number of perfect matchings of middle graphs.
Discret. Appl. Math., 2025
Combinatorial identities arising from permanents for Euler numbers and Stirling numbers.
Adv. Appl. Math., 2025
2024
Enumeration of perfect matchings of the middle graph of a graph <i>G</i> with △(<i>G</i>)≤4.
Discret. Math., April, 2024
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph.
Discret. Math., 2024
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip.
Discret. Appl. Math., 2024
2023
Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications.
Appl. Math. Comput., November, 2023
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest.
J. Graph Theory, September, 2023
On the dimer problem of the vertex-edge graph of a cubic graph.
Discret. Math., August, 2023
Identifying Plagiarised Programming Assignments with Detection Tool Consensus.
Informatics Educ., 2023
Counting spanning trees with a Kekulé structure in linear hexagonal chains.
Appl. Math. Comput., 2023
2022
Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs.
Discret. Math., 2022
Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs.
Discret. Math., 2022
A type of generalized mesh-star transformation and applications in electrical networks.
Discret. Appl. Math., 2022
On eigenvalues and the energy of dendrimer trees.
Appl. Math. Comput., 2022
Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices.
Adv. Appl. Math., 2022
2021
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision.
Discret. Appl. Math., 2021
Resistance distances in vertex-weighted complete multipartite graphs.
Appl. Math. Comput., 2021
2020
A New Proof of Foster's First Theorem.
Am. Math. Mon., 2020
Using edge generating function to solve monomer-dimer problem.
Adv. Appl. Math., 2020
2019
Resistance between two vertices of almost complete bipartite graphs.
Discret. Appl. Math., 2019
Resistances between two nodes of a path network.
Appl. Math. Comput., 2019
2018
Spectra of the generalized edge corona of graphs.
Discret. Math. Algorithms Appl., 2018
Spanning trees and dimer problem on the Cairo pentagonal lattice.
Appl. Math. Comput., 2018
2017
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs.
J. Graph Theory, 2017
Enumeration of spanning trees of middle graphs.
Appl. Math. Comput., 2017
2016
Extremal matching energy of complements of trees.
Discuss. Math. Graph Theory, 2016
2014
The matching energy of graphs with given parameters.
Discret. Appl. Math., 2014
2013
On the number of spanning trees of some irregular line graphs.
J. Comb. Theory A, 2013
On the number of perfect matchings of line graphs.
Discret. Appl. Math., 2013
2012
Kekulé structures of polyomino chains and the Hosoya index of caterpillar trees.
Discret. Math., 2012
The asymptotic behavior of some indices of iterated line graphs of regular graphs.
Discret. Appl. Math., 2012
2011
Enumeration of spanning trees of graphs with rotational symmetry.
J. Comb. Theory A, 2011
2009
Enumerating spanning trees of graphs with an involution.
J. Comb. Theory A, 2009
On the matching polynomial of subdivision graphs.
Discret. Appl. Math., 2009
2008
A quadratic identity for the number of perfect matchings of plane graphs.
Theor. Comput. Sci., 2008
2007
The behavior of Wiener indices and polynomials of graphs under five graph decorations.
Appl. Math. Lett., 2007
The determinants of <i>q</i>-distance matrices of trees and two quantities relating to permutations.
Adv. Appl. Math., 2007
Replacing Pfaffians and applications.
Adv. Appl. Math., 2007
2006
Enumeration of subtrees of trees.
Theor. Comput. Sci., 2006
A simple proof of Graham and Pollak's theorem.
J. Comb. Theory A, 2006
Enumeration of perfect matchings of a type of Cartesian products of graphs.
Discret. Appl. Math., 2006
2005
Graphical condensation of plane graphs: A combinatorial approach.
Theor. Comput. Sci., 2005
Graphical condensation for enumerating perfect matchings.
J. Comb. Theory A, 2005
The number of spanning trees of plane graphs with reflective symmetry.
J. Comb. Theory A, 2005
On the minimal energy of trees with a given diameter.
Appl. Math. Lett., 2005
Indices of convergence on four digraph operators.
Australas. J Comb., 2005
2004
Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians.
Adv. Appl. Math., 2004
2003
Heredity of the index of convergence of the line digraph.
Discret. Appl. Math., 2003