Perfect Matchings in Polyhexes, or Recent Graph-theoretical Contributions to Benzenoids

نویسندگان

  • Alexandru T. Balaban
  • Milan Randic
چکیده

After an introduction on the history of polycyclic aromatic compounds, recent advances in the theory of benzenoids are briefly reviewed. Then using systems with 4, 5, or 6 benzenoid rings for illustration, the partition of the P π-electrons among the rings of the benzenoid is presented, followed by a different way of examining the distribution of these π-electrons which is called the signature of the benzenoid, consisting in six integers from s6 to s1. The P π-electrons are divided between the two sums s6 + s5 + s2 + s1 and s4 + s3 characterizing thereby the closeness of benzenoids to all-resonant structures according to Clars theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect Matchings in Edge-Transitive Graphs

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

متن کامل

Altan derivatives of a graph

Altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. We now provide a generalization of the altan concept, applicable to any graph. Several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. Among these ar...

متن کامل

Graph Theoretical Representation of Atomic Asymmetry and Molecular Chirality of Benzenoids in Two-Dimensional Space

In order to explore atomic asymmetry and molecular chirality in 2D space, benzenoids composed of 3 to 11 hexagons in 2D space were enumerated in our laboratory. These benzenoids are regarded as planar connected polyhexes and have no internal holes; that is, their internal regions are filled with hexagons. The produced dataset was composed of 357,968 benzenoids, including more than 14 million at...

متن کامل

2-extendability of toroidal polyhexes and Klein-bottle polyhexes

A toroidal polyhex (resp. Klein-bottle polyhex) described by a string (p, q, t) arises from a p × q-parallelogram of a hexagonal lattice by a usual torus (resp. Klein bottle) boundary identification with a torsion t. A connected graph G admitting a perfect matching is kextendable if |V(G)| ≥ 2k + 2 and any k independent edges can be extended to a perfect matching of G. In this paper, we charact...

متن کامل

Graphical condensation for enumerating perfect matchings

The method of graphical condensation for enumerating perfect matchings was found by Propp (Theoretical Computer Science 303(2003), 267-301), and was generalized by Kuo (Theoretical Computer Science 319 (2004), 29-57). In this paper, we obtain some more general results on graphical condensation than Kuo’s. Our method is also different from Kuo’s. As applications of our results, we obtain a new p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2007