Matches in DBpedia 2014 for { ?s ?p In the mathematical field of graph theory, the ladder graph Ln is a planar undirected graph with 2n vertices and n+2(n-1) edges.The ladder graph can be obtained as the Cartesian product of two path graphs, one of which has only one edge: Ln,1 = Pn × P1. Adding two more crossed edges connecting the four degree-two vertices of a ladder graph produces a cubic graph, the Möbius ladder.By construction, the ladder graph Ln is isomorphic to the grid graph G2,n and looks like a ladder with n rungs.. }
Showing items 1 to 1 of
1
with 100 items per page.
- Ladder_graph comment "In the mathematical field of graph theory, the ladder graph Ln is a planar undirected graph with 2n vertices and n+2(n-1) edges.The ladder graph can be obtained as the Cartesian product of two path graphs, one of which has only one edge: Ln,1 = Pn × P1. Adding two more crossed edges connecting the four degree-two vertices of a ladder graph produces a cubic graph, the Möbius ladder.By construction, the ladder graph Ln is isomorphic to the grid graph G2,n and looks like a ladder with n rungs.".