mathworld.wolfram.com/CamelGraph.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

7

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/CamelGraph.html

Camel Graph -- from Wolfram MathWorld

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...



Bing

Camel Graph -- from Wolfram MathWorld

https://mathworld.wolfram.com/CamelGraph.html

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...



DuckDuckGo

https://mathworld.wolfram.com/CamelGraph.html

Camel Graph -- from Wolfram MathWorld

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...

  • General Meta Tags

    30
    • title
      Camel Graph -- from Wolfram MathWorld
    • DC.Title
      Camel Graph
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...
    • description
      A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_CamelGraph.png
    • og:url
      https://mathworld.wolfram.com/CamelGraph.html
    • og:type
      website
    • og:title
      Camel Graph -- from Wolfram MathWorld
    • og:description
      A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Camel Graph -- from Wolfram MathWorld
    • twitter:description
      A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves that change by one square along one axis of the board and three squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable camel moves are considered edges. It is therefore a (1,3)-leaper graph, as well as the Euclidean distance-sqrt(10)...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_CamelGraph.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/CamelGraph.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

56