Perfect Matching

On the anti-Kekule number of k-polyomino system
The anti-Kekulé number of a graph G with a perfect matching, is defined to be the minimum number of edges that should be deleted such …
Cite DOI
On bipartite edge frustration of carbon and boron nanotubes
The measure of bipartivity is one of the important topological and structural property which describes the chemical stability of …
Cite DOI
On the anti-kekulé number of nanotubes and nanocones
Let G(V,E)be a connected graph. A set M ⊆ E is called a matching if no two edges in M have a common end-vertex. A matching M in G is …
Cite DOI
Bipartite edge frustration of cactus chains
A molecular graph is a graphical representation of a chemical structure which is constructed by using certain graph operation. …
Cite DOI