An introduction to -graphs, a graph-theoretic representation of natural numbers.
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs.
On coefficients of path polynomials.
A result on co-chromatic graphs.
A generalization of the dichromatic polynomial of a graph.
Matchings in hexagonal cacti.
Path decompositions of chains and circuits.
Forest decompositions of graphs with cyclomatic number 2.
Forest decompositions of graphs with cyclomatic number 3.
On coefficients of circuit polynomials and characteristic polynomials.
On a class of polynomials associated with the cliques in a graph and its applications.
On the reconstruction of the matching polynomial and the reconstruction conjecture.
Some general classes of comatching graphs.
The matching polynomial of a distance-regular graph.
On star polynomials, graphical partitions and reconstruction.
Connections between the matching and chromatic polynomials.
An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs
Page 1