scientific article; zbMATH DE number 7124341

zbMATH Open1425.05137MaRDI QIDQ5241183FDOQ5241183

Sunil Kumar Raghavan Unnithan, Kannan Balakrishnan

Publication date: 30 October 2019

Title of this publication is not available (Why is that?)

zbMATH Keywords

central vertexconvex subgraphbetweenness centralityextreme vertexvertex amalgamationedge amalgamationpath amalgamationsubgraph amalgamation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On the corona of two graphs
• A faster algorithm for betweenness centrality*
• The cordiality of one-point union of \(n\) copies of a graph
• The Number of Linear, Directed, Rooted, and Connected Graphs
• Betweenness centrality in some classes of graphs
• On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\)

Cited In (5)

• Title not available (Why is that?)
• On the connectivity and the diameter of betweenness-uniform graphs
• Betweenness centrality in Cartesian product of graphs
• On the connectivity and the diameter of betweenness-uniform graphs
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241183)