Q5241183 (Q5241183): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A faster algorithm for betweenness centrality* / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the corona of two graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Number of Linear, Directed, Rooted, and Connected Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Betweenness centrality in some classes of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The cordiality of one-point union of \(n\) copies of a graph / rank | |||
Normal rank |
Latest revision as of 20:25, 20 July 2024
scientific article; zbMATH DE number 7124341
Language | Label | Description | Also known as |
---|---|---|---|
English | No label defined |
scientific article; zbMATH DE number 7124341 |
Statements
30 October 2019
0 references
betweenness centrality
0 references
central vertex
0 references
extreme vertex
0 references
convex subgraph
0 references
vertex amalgamation
0 references
edge amalgamation
0 references
path amalgamation
0 references
subgraph amalgamation
0 references