Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers

DOI10.2140/INVOLVE.2017.10.583MaRDI QIDQ520432zbMATH OpenOpenAlexFDO

Authors Roger jun. Vargas, Abigail Waldron, Anika Sharma, Rigoberto Flórez, Darren Narayan

Publication date 3 April 2017

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2017.10.583

zbMATH Keywords

knight's graphsleverage centrality

Mathematics Subject Classification ID

Vertex degrees (05C07)

Recommendations

• Betweenness centrality in Cartesian product of graphs
• Betweenness centrality in Cartesian product of graphs
• On the power domination number of the Cartesian product of graphs
• Power domination of the Cartesian product of graphs
• scientific article; zbMATH DE number 3882484
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• Enumerating shortest paths and determining edge betweenness centrality in Cartesian products of paths and cycles
• Centers of n-fold tensor products of graphs
• Total \(k\)-domination in Cartesian product graphs
• Cartesian product graphs and \(k\)-tuple total domination

Cited in

(5)

• A graph theoretic analysis of leverage centrality
• Leverage centrality analysis on generalized transformation of path graph
• Leverage centrality in corona product of cycle with some graphs
• Leverage centrality on barycentric subdivision of some graphs
• On the representation number of chessboard graphs

This page was built for publication: Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers

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