2021
Tutte polynomials of fan-like graphs with applications in benzenoid systems.
Appl. Math. Comput., 2021
2017
A linear algorithm for a perfect matching in polyomino graphs.
Theor. Comput. Sci., 2017
On the incidence energy of graphs under three graph decorations.
Ars Comb., 2017
2014
The critical group of a clique-inserted graph.
Discret. Math., 2014
2013
On the number of perfect matchings of line graphs.
Discret. Appl. Math., 2013
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, Ser. A, 2011
Matching polynomials for chains of cycles.
Discret. Math., 2011
Extremal polygonal cactus chain concerning k-independent sets.
Ars Comb., 2011
2010
Relation between wiener numbers of quasi-hexagonal chains and quasi-polyomino chains.
J. Syst. Sci. Complex., 2010
Counting the cyclocized polyphenacenes.
J. Comput. Chem., 2010
Zeros of the Jones Polynomial are Dense in the Complex Plane.
Electron. J. Comb., 2010
Extremal polyphenyl chains concerning k-matchings and k-independent sets.
Ars Comb., 2010
2009
Enumerating spanning trees of graphs with an involution.
J. Comb. Theory, Ser. A, 2009
The graph of perfect matching polytope and an extreme problem.
Discret. Math., 2009
2008
A quadratic identity for the number of perfect matchings of plane graphs.
Theor. Comput. Sci., 2008
Links and cubic 3-polytopes.
Math. Comput., 2008
Multi-hop all-to-all optical routings in Cartesian product networks.
Inf. Process. Lett., 2008
Rainbow H-Factors of Complete s-Uniform r-Partite Hypergraphs.
Electron. J. Comb., 2008
2007
Extremal double hexagonal chains with respect to k-matchings and k-independent sets.
Discret. Appl. Math., 2007
Resistance distance and the normalized Laplacian spectrum.
Discret. Appl. Math., 2007
The replacements of signed graphs and Kauffman brackets of link families.
Adv. Appl. Math., 2007
2006
Construction for bicritical graphs and <i>k</i>-extendable bipartite graphs.
Discret. Math., 2006
On commutativity of two unary digraph operations: Subdividing and line-digraphing.
Discret. Math., 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, Ser. A, 2005
The number of spanning trees of plane graphs with reflective symmetry.
J. Comb. Theory, Ser. A, 2005
Super Restricted Edge Connectivity of Regular Graphs.
Graphs Comb., 2005
Perfect Matchings of the Small Polyominoes.
Electron. Notes Discret. Math., 2005
3-Restricted Edge Connectivity Of Vertex Transitive Graphs.
Ars Comb., 2005
The Kauffman brackets for equivalence classes of links.
Adv. Appl. Math., 2005
The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph.
Proceedings of the Discrete Geometry, 2005
2004
<i>Z</i>-transformation graphs of perfect matchings of plane bipartite graphs.
Discret. Math., 2004
Reducible chains of planar 1-cycle resonant graphs.
Discret. Math., 2004
The number of spanning trees in odd valent circulant graphs.
Discret. Math., 2004
Expanding and forwarding parameters of product graphs.
Discret. Appl. Math., 2004
Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians.
Adv. Appl. Math., 2004
The rapid mixing of random walks defined by an <i>n</i>-cube.
Adv. Appl. Math., 2004
2003
Heredity of the index of convergence of the line digraph.
Discret. Appl. Math., 2003
Planar k-cycle resonant graphs with k=1, 2.
Discret. Appl. Math., 2003
2002
Ordering graphs with small index and its application.
Discret. Appl. Math., 2002
2001
k-Resonant Benzenoid Systems and k-Cycle Resonant Graphs.
J. Chem. Inf. Comput. Sci., 2001
2000
Total Z-transformation graphs of perfect matching of plane bipartite graphs.
Electron. Notes Discret. Math., 2000
The Clar covering polynomial of hexagonal systems III.
Discret. Math., 2000
Plane elementary bipartite graphs.
Discret. Appl. Math., 2000
1999
Acyclic Molecules with Greatest HOMO-LUMO Separation.
Discret. Appl. Math., 1999
On Acyclic Conjugated Molecules with Minimal Energies.
Discret. Appl. Math., 1999
Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs.
Ars Comb., 1999
1998
When a digraph and its line digraph are connected and cospectral.
Discret. Math., 1998
On maximal energy ordering of acyclic conjugated molecules.
Proceedings of the Discrete Mathematical Chemistry, 1998
1997
Perfect Matchings of Polyomino Graphs.
Graphs Comb., 1997
Perfect matchings and ears in elementary bipartite graphs.
Discret. Math., 1997
On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs.
Discret. Appl. Math., 1997
A Note on the Number of Perfect Matchings of Bipartite Graphs.
Discret. Appl. Math., 1997
The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs.
Discret. Appl. Math., 1997
Hamilton Paths in Z-transformation Graphs of Perfect Matchings of Hexagonal Systems.
Discret. Appl. Math., 1997
Regular Coronoid Systems.
Discret. Appl. Math., 1997
1996
Concealed Non-Kekuléan Benzenoids [J. Chem. Inf. Comput. Sci 35, 226-232 (1995)].
J. Chem. Inf. Comput. Sci., 1996
The Clar Covering Polynomial of Hexagonal Systems I.
Discret. Appl. Math., 1996
1995
Concealed Non-Kekul.acte.ean Benzenoids.
J. Chem. Inf. Comput. Sci., 1995
Hexagonal systems with forcing edges.
Discret. Math., 1995
1994
n-Dimensional line graphs.
Discret. Math., 1994
Hamiltonicity of a Type of Interchange Graphs.
Discret. Appl. Math., 1994
1993
J. Chem. Inf. Comput. Sci., 1993
Hexagonal Systems with Fixed Bonds.
Discret. Appl. Math., 1993
1992
Enumeration and classification of benzenoid systems. 32. Normal perifusenes with two internal vertices.
J. Chem. Inf. Comput. Sci., 1992
Reducible chains in several types of 2-connected graphs.
Discret. Math., 1992
Generalized hexagonal systems with each hexagon being resonant.
Discret. Appl. Math., 1992
1991
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs.
Discret. Math., 1991
When each hexagon of a hexagonal system covers it.
Discret. Appl. Math., 1991
Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs.
Discret. Appl. Math., 1991
1988
Z-transformation graphs of perfect matchings of hexagonal systems.
Discret. Math., 1988
Bounds of the longest directed cycle length for minimal strong digraphs.
Discret. Math., 1988
Matching polynomials of two classes of graphs.
Discret. Appl. Math., 1988
1987
Hamilton cycles in directed Euler tour graphs.
Discret. Math., 1987
1986
Hamilton cycles in Euler tour graph.
J. Comb. Theory, Ser. B, 1986
On the ordering of graphs with respect to their matching numbers.
Discret. Appl. Math., 1986
1985
Perfect matchings in hexagonal systems.
Graphs Comb., 1985
