for the analysis of structures, the first step consists of configuration processing followed by data generation. this step is the most time consuming part of the analysis for large-scale structures. in this paper new graph products called triangular and circular graph products are developed for the formation of the space structures. the graph products are extensively used in graph theory and co...

Aspect graphs have been the object of very active research by the computer vision community in recent years, but most of it has concentrated on the design of algorithms to compute the representation. In this paper, we work on a more theoretical level to give enumerative properties of the di erent entities entering in the construction of aspect graphs of objects bounded by smooth surfaces, namel...

An equitable graph coloring is a proper vertex coloring, such that the size of the color classes differ by at most one. We present a flow-based scheme for generating pruning rules for enumerative algorithms such as DSATUR. The scheme models the extendability of a partial (equitable) coloring into an equitable coloring via network flows. Computational experiments show that significant reductions...

We present a new distributed-memory algorithm for enumerative LTL modelchecking that is designed to be run on a cluster of workstations communicating via MPI. The detection of accepting cycles is based on computing maximal accepting predecessors and the subsequent decomposition of the graph into independent predecessor subgraphs induced by maximal accepting predecessors. Several optimizations o...

In this article, some interesting applications of generalized inverses in the graph theory are revisited. Interesting properties employed to make proof several known results simpler, and techniques such as bordering method inverse complemented matrix methods used obtain simple expressions for Moore-Penrose incidence Laplacian matrix. Some simpler obtained special cases tree graph, complete bipa...

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1 The modern face of enumerative combinatorics. . . . . . . . . . . . . . . . . . . . . . . . 3 2 Algebraic invariants and combinatorial structures . . . . . . . . . . . . . . . . . . . . . 4 3 Combinatorics and geometry. . . . . . . . . . . . . . . . . . . . . . ...