Matches in DBpedia 2014 for { <http://dbpedia.org/resource/F26A_graph> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- F26A_graph abstract "In the mathematical field of graph theory, the F26A graph is a symmetric bipartite cubic graph with 26 vertices and 39 edges.It has chromatic number 2, chromatic index 3, diameter 5, radius 5 and girth 6. It is also a 3-vertex-connected and 3-edge-connected graph.The F26A graph is Hamiltonian and can be described by the LCF notation [−7, 7]13.".
- F26A_graph thumbnail F26A_graph.svg?width=300.
- F26A_graph wikiPageID "24054940".
- F26A_graph wikiPageRevisionID "545711949".
- F26A_graph automorphisms "78".
- F26A_graph chromaticIndex "3".
- F26A_graph chromaticNumber "2".
- F26A_graph diameter "5".
- F26A_graph edges "39".
- F26A_graph girth "6".
- F26A_graph hasPhotoCollection F26A_graph.
- F26A_graph imageCaption "The F26A graph is Hamiltonian.".
- F26A_graph name "F26 graph".
- F26A_graph properties Cayley_graph.
- F26A_graph properties Cubic_graph.
- F26A_graph properties Hamiltonian_path.
- F26A_graph properties Symmetric_graph.
- F26A_graph radius "5".
- F26A_graph vertices "26".
- F26A_graph subject Category:Individual_graphs.
- F26A_graph subject Category:Regular_graphs.
- F26A_graph comment "In the mathematical field of graph theory, the F26A graph is a symmetric bipartite cubic graph with 26 vertices and 39 edges.It has chromatic number 2, chromatic index 3, diameter 5, radius 5 and girth 6. It is also a 3-vertex-connected and 3-edge-connected graph.The F26A graph is Hamiltonian and can be described by the LCF notation [−7, 7]13.".
- F26A_graph label "F26A graph".
- F26A_graph sameAs m.07kck32.
- F26A_graph sameAs Q5424189.
- F26A_graph sameAs Q5424189.
- F26A_graph wasDerivedFrom F26A_graph?oldid=545711949.
- F26A_graph depiction F26A_graph.svg.
- F26A_graph isPrimaryTopicOf F26A_graph.
