mathworld.wolfram.com/AntelopeGraph.html

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

Linked Hostnames

7

Thumbnail

Search Engine Appearance

Google

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

Antelope Graph -- from Wolfram MathWorld

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...



Bing

Antelope Graph -- from Wolfram MathWorld

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

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...



DuckDuckGo

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

Antelope Graph -- from Wolfram MathWorld

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...

  • General Meta Tags

    36
    • title
      Antelope Graph -- from Wolfram MathWorld
    • DC.Title
      Antelope Graph
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...
    • description
      An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_AntelopeGraph.png
    • og:url
      https://mathworld.wolfram.com/AntelopeGraph.html
    • og:type
      website
    • og:title
      Antelope Graph -- from Wolfram MathWorld
    • og:description
      An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Antelope Graph -- from Wolfram MathWorld
    • twitter:description
      An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph. The plots above...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_AntelopeGraph.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/AntelopeGraph.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

61