Combinatorica`
Combinatorica`

Eccentricity

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

Eccentricity[g]

gives the eccentricity of each vertex of graph g, the maximum length among all shortest paths from .

更多信息和选项

范例

基本范例  (2)

Eccentricity has been superseded by VertexEccentricity:

Wolfram Research (2007),Eccentricity,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html.

文本

Wolfram Research (2007),Eccentricity,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html.

CMS

Wolfram 语言. 2007. "Eccentricity." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html.

APA

Wolfram 语言. (2007). Eccentricity. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html 年

BibTeX

@misc{reference.wolfram_2024_eccentricity, author="Wolfram Research", title="{Eccentricity}", year="2007", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html}", note=[Accessed: 18-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_eccentricity, organization={Wolfram Research}, title={Eccentricity}, year={2007}, url={https://reference.wolfram.com/language/Combinatorica/ref/Eccentricity.html}, note=[Accessed: 18-November-2024 ]}