TOPICS
Search

Pendant Edge

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.

See also

Pendant Vertex

Explore with Wolfram|Alpha

References

Levit, V. E. and Mandrescu, E. "The Independence Polynomial of a Graph--A Survey." In Proceedings of the 1st International Conference on Algebraic Informatics. Held in Thessaloniki, October 20-23, 2005 (Ed. S. Bozapalidis, A. Kalampakas, and G. Rahonis). Thessaloniki, Greece: Aristotle Univ., pp. 233-254, 2005.

Referenced on Wolfram|Alpha

Pendant Edge

Cite this as:

Weisstein, Eric W. "Pendant Edge." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/PendantEdge.html