Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements (Q602723): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2024187520
@@ Property / OpenAlex ID: W2024187520 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2322
@@ Property / arXiv ID: 0801.2322 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric squares of graphs
@@ Property / cites work: Symmetric squares of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Random Graph Isomorphism
@@ Property / cites work: Random Graph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal lower bound on the number of variables for graph identification
+Normal rank
@@ Property / cites work @@
+Q4535027
@@ Property / cites work: Q4535027 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence in finite-variable logics is complete for polynomial time
+Normal rank
@@ Property / cites work @@
+Isomorphism testing for embeddable graphs through definability
+Normal rank
@@ Property / cites work @@
+Q5676231
@@ Property / cites work: Q5676231 / rank @@
+Normal rank