A detailed review of the asymptotic matching procedures predicting formation number vortex rings is presented. The original studies Mohseni and Gharib [“A model for universal timescale ring formation,” Phys. Fluids 10(10), 2436–2438 (1998).], Shusser new inviscid rings,” in 30th AIAA Fluid Dynamical Conference (1999).], Linden Turner [“The ‘optimal’ rings, efficiency propulsion devices,” J. Mec...

Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...

For a k-graph F?[n]k, the clique number of F is defined to be maximum size subset Q [n] with Qk?F. In present paper, we determine edges in on matching at most s and least q for n?8k2s q?(s+1)k?l, n?(s+1)k+s/(3k)?l. Two special cases that q=(s+1)k?2 k=2 are solved completely.

A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. If G does not contain K1,...

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those inci...

an algorithm is suggested for implementation of unlimited primaries in two-constants kubelka-munk color matching attempt. allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. by application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as allen suggested. the suggested ...

A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the countably infinite connectedhomogeneous graphs. We prove that if Γ is connected countably infinite and connected-homogeneous then Γ is isomorphic to one of: Lachlan and Woodrow’s ultrahomogeneous graphs; the generic bipartite graph...