请输入您要查询的字词:

 

单词 Eulerian graph
释义
Eulerian graph

Mathematics
  • One area of graph theory is concerned with the possibility of travelling around a graph, going along edges in such a way as to use every edge exactly once. A connected graph is called Eulerian if there is a sequence v0, e1, v1, …, ek, vk alternately of vertices and edges (where ei is an edge joining vi−1 and vi), with v0 = vk and with every edge of the graph occurring exactly once. Simply put, it means that ‘you can draw the graph without taking your pencil off the paper or retracing any lines, ending at your starting‐point’. The name arises from Euler’s consideration of the problem of whether the bridges of Königsberg could be crossed in this way. It can be shown that a connected graph is Eulerian if and only if every vertex has even degree. Compare Hamiltonian graph, traversable graph.


随便看

 

科学参考收录了60776条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2024/12/25 13:41:27