The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being adjacent if their symmetric difference forms the edge set of a hexagon of G. It is proved that the smallest number of elementary cuts that cover a catacondensed benzenoid graph equals the dimension of a largest induced hypercube of its resonance graph
In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid gra...
Glavno področje diplomskega dela je poiskati povezavo med maksimalnimi resonantnimi množicami benzen...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
AbstractThe resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors...
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the ...
benzenoid graph, the size of a maximum matching equals the number of positive eigenvalues. Later, th...
AbstractLet G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) ...
AbstractThe resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, ...
Pi-sextet resonance between Kekulé valence structures of benzenoid hydrocarbons are depicted by benz...
The Fibonacci dimension ▫$text{fdim}(G)$▫ of a graph ▫$G$▫ was introduced [in S. Cabello, D. Eppstei...
AbstractThe phenomenon of resonance amongst a set of different classical chemical structures entails...
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs wit...
AbstractIt is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to th...
AbstractWe consider a partitioning problem, defined for bipartite and 2-connected plane graphs, wher...
A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior reg...
In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid gra...
Glavno področje diplomskega dela je poiskati povezavo med maksimalnimi resonantnimi množicami benzen...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
AbstractThe resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors...
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the ...
benzenoid graph, the size of a maximum matching equals the number of positive eigenvalues. Later, th...
AbstractLet G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) ...
AbstractThe resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, ...
Pi-sextet resonance between Kekulé valence structures of benzenoid hydrocarbons are depicted by benz...
The Fibonacci dimension ▫$text{fdim}(G)$▫ of a graph ▫$G$▫ was introduced [in S. Cabello, D. Eppstei...
AbstractThe phenomenon of resonance amongst a set of different classical chemical structures entails...
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs wit...
AbstractIt is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to th...
AbstractWe consider a partitioning problem, defined for bipartite and 2-connected plane graphs, wher...
A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior reg...
In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid gra...
Glavno področje diplomskega dela je poiskati povezavo med maksimalnimi resonantnimi množicami benzen...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
DOI
Add to ORKG