Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ladder_graph> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- Ladder_graph abstract "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. It is Hamiltonian with girth 4 (if n>1) and chromatic index 3 (if n>2).The chromatic number of the ladder graph is 2 and its chromatic polynomial is .".
- Ladder_graph thumbnail Ladder_graph_L8.svg?width=300.
- Ladder_graph wikiPageID "19657952".
- Ladder_graph wikiPageRevisionID "373365478".
- Ladder_graph chromaticIndex "1".
- Ladder_graph chromaticIndex "2".
- Ladder_graph chromaticIndex "3".
- Ladder_graph chromaticNumber "2".
- Ladder_graph edges "n+2".
- Ladder_graph hasPhotoCollection Ladder_graph.
- Ladder_graph imageCaption "The ladder graph L8.".
- Ladder_graph name "Ladder graph".
- Ladder_graph notation "Ln".
- Ladder_graph properties Bipartite_graph.
- Ladder_graph properties Hamiltonian_path.
- Ladder_graph properties Planar_graph.
- Ladder_graph properties Unit_distance_graph.
- Ladder_graph vertices "2".
- Ladder_graph subject Category:Parametric_families_of_graphs.
- Ladder_graph subject Category:Planar_graphs.
- Ladder_graph type Abstraction100002137.
- Ladder_graph type Communication100033020.
- Ladder_graph type Graph107000195.
- Ladder_graph type PlanarGraphs.
- Ladder_graph type VisualCommunication106873252.
- 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.".
- Ladder_graph label "Ladder graph".
- Ladder_graph label "Leitergraph".
- Ladder_graph sameAs Leitergraph.
- Ladder_graph sameAs m.07s88tw.
- Ladder_graph sameAs Q6469318.
- Ladder_graph sameAs Q6469318.
- Ladder_graph sameAs Ladder_graph.
- Ladder_graph wasDerivedFrom Ladder_graph?oldid=373365478.
- Ladder_graph depiction Ladder_graph_L8.svg.
- Ladder_graph isPrimaryTopicOf Ladder_graph.