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...

In this chapter, a statistical measure of complexity and the FisherShannon information product are introduced and their properties are discussed. These measures are based on the interplay between the Shannon information, or a function of it, and the separation of the set of accessible states to a system from the equiprobability distribution, i.e. the disequilibrium or the Fisher information, re...

‎let $g$ be a group and $a=aut(g)$ be the group of automorphisms of‎ ‎$g$‎. ‎then the element $[g,alpha]=g^{-1}alpha(g)$ is an‎ ‎autocommutator of $gin g$ and $alphain a$‎. ‎also‎, ‎the‎ autocommutator subgroup of g is defined to be‎ ‎$k(g)=langle[g,alpha]|gin g‎, ‎alphain arangle$‎, ‎which is a‎ ‎characteristic subgroup of $g$ containing the derived subgroup‎ ‎$g'$ of $g$‎. ‎a group is defined...

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...

Imagine the situation: “One day, you notice an old country woman crossing a downtown street, just about to put one foot down on the rails of the streetcar line. [...] Suppose, now, that at the very moment she puts her foot on the rail a streetcar comes rushing down the tracks toward her. If the old woman does not notice the car and continues across the tracks nothing will happen. But if someone...