A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (Q4315432): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/cnm.1640101107 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168238367 / rank | |||
Normal rank | |||
Revision as of 19:26, 19 March 2024
scientific article; zbMATH DE number 701727
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph |
scientific article; zbMATH DE number 701727 |
Statements
A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (English)
0 references
14 November 1995
0 references
endpoints
0 references
spectral graph
0 references
Laplacian matrix of a graph
0 references
algorithm
0 references
pseudoperipheral vertex
0 references
pseudodiameter
0 references
sparse matrix equations
0 references
