#Does every graph have a spanning elementary subgraph (Spectral Graph Theory)

9 messages · Page 1 of 1 (latest)

waxen quest
#

Well the obvious answer would be no but I'm trying to figure out how the harary's determinant formula works if there are no elementary spanning subgraphs especially for trees as they have to be unimodular

tiny lynxBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
waxen quest
#

or more like have unimodular adjacency matrices

waxen quest
#

actually bruh I understand now

#

The problem I was trying to solve stated that adjacency matrices of trees were totally unimodular

#

while I was trying to prove that they were unimodular

#

which is yeah total skill issue from my side

#

+close