Kite Graph

The kite graph is the 5-vertex graph illustrated above (Brandstädt et al. 1987, p. 18). It is implemented in the Wolfram Language as GraphData["KiteGraph"].

Unfortunately, the term is also used to refer to the diamond graph (e.g., West 2000, p. 12) or a tadpole graph (Kim and Park 2006, Gallian 2018).

Explore with Wolfram|Alpha

More things to try:

References

Brandstädt, A.; Le, V. B.; and Spinrad, J. P. Graph Classes: A Survey. Philadelphia, PA: SIAM, p. 18, 1987.Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.ISGCI: Information System on Graph Class Inclusions v2.0. "List of Small Graphs." http://www.graphclasses.org/smallgraphs.html.Kim, S.-R. and Park, J. Y. "On Super Edge-Magic Graphs." Ars Combin. 81, 113-127, 2006.West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 12, 2000.

Cite this as:

Weisstein, Eric W. "Kite Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/KiteGraph.html

Subject classifications

pFad - Phonifier reborn

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Kite Graph

See also

Explore with Wolfram|Alpha

References

Cite this as:

Subject classifications

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.