mathworld.wolfram.com/CubicSymmetricGraph.html

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

Linked Hostnames

11

Thumbnail

Search Engine Appearance

Google

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

Cubic Symmetric Graph -- from Wolfram MathWorld

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...



Bing

Cubic Symmetric Graph -- from Wolfram MathWorld

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

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...



DuckDuckGo

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

Cubic Symmetric Graph -- from Wolfram MathWorld

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...

  • General Meta Tags

    50
    • title
      Cubic Symmetric Graph -- from Wolfram MathWorld
    • DC.Title
      Cubic Symmetric Graph
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...
    • description
      A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_CubicSymmetricGraph.png
    • og:url
      https://mathworld.wolfram.com/CubicSymmetricGraph.html
    • og:type
      website
    • og:title
      Cubic Symmetric Graph -- from Wolfram MathWorld
    • og:description
      A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Cubic Symmetric Graph -- from Wolfram MathWorld
    • twitter:description
      A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest and study. Since cubic graphs must have an even number of vertices, so must cubic symmetric graphs. Bouwer et al. (1988) published data for all connected cubic symmetric graphs on up to 512 vertices. Conder and Dobcsányi (2002) found all cubic symmetric graphs up to 768 vertices. Royle maintains a list of known...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_CubicSymmetricGraph.png

  • Link Tags

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

88