41 search results - page 7 / 9 » dm 1999 |
DM
1999
13 years 8 months ago
1999
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
DM
1999
13 years 8 months ago
1999
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
DM
1999
13 years 8 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
DM
1999
13 years 8 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
DM
1999
13 years 8 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...