Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"incidence graph"”.
-
Coloring of Metric Spaces and L(2,1)-Labeling of Graphs
… lambda(G) = q 2 + q = Delta2 - Delta for the incidence graph G of the projective plane PG (2, q). To prove this result, we convert the problem to a problem of packing of bipartite graphs into a complete bipartite graph. We also bound lambda(G) when G is the Kneser graph K(2k + 1, k).
-
Simulation modeling methodology: principles and etiology of decision support
… of computation provided by the action cluster incidence graph (ACIG), an implementation structure referred to as a direct execution of action clusters (DEAC) simulation is defined. A DEAC simulation is simply an execution of an augmented CS transition specification. Two algorithms for DEAC …
-
Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one of the progenitors of graph theory --- dating back to the eighteenth century --- treatment of this subject has only …