384 search results - page 1 / 77 » On s-hamiltonian-connected line graphs |
ARSCOM
2008
13 years 4 months ago
2008
COMPUTING
1999
13 years 4 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
ISPAN
2008
IEEE
13 years 11 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
DM
2008
13 years 4 months ago
2008
A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deleti...