384 search results - page 1 / 77 » On s-hamiltonian-connected line graphs |
ARSCOM
2008
14 years 10 months ago
2008
COMPUTING
1999
14 years 10 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
118
click to vote
ISAAC
2010
Springer
14 years 8 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 ...
107
click to vote
ISPAN
2008
IEEE
15 years 5 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...
88
Voted
DM
2008
14 years 10 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...