ILIGRA

swMATH13632MaRDI QIDQ25546FDOQ25546

Author name not available (Why is that?)

Described by source

• ILIGRA: an efficient inverse line graph algorithm

Cited In (4)

• Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
• Degree distribution and assortativity in line graphs of complex networks
• Graphs with least eigenvalue \(-2\): ten years on
• Biclique graphs of interval bigraphs

This page was built for software: ILIGRA