Yes. Front analysis [0] and also critical path analysis are useful. Real graphs look like social networks, with some clusters and nodes with very high relation

Yes. Front analysis [0] and also critical path analysis are useful. Real graphs look like social networks, with some clusters and nodes with very high relational degree, and some with almost none. But for security they are more like dependency graphs rather than just attack paths as in Blotto. An adversary blockades/sabotages them or blocks those on which they depend etc. The more resilient graph is the best connected by alternative paths. Go back and look at some DARPA papers on route security in the formative "Internet". What we have today are very insecure graphs with millions of logical dependency links going in/out of single centres of functionality, and not much peer connectivity. Hit a few critical nodes and the whole lot goes down. [0] https://en.wikipedia.org/wiki/Blotto_game https://en.wikipedia.org/wiki/Blotto_game