The Surprisingly Difficult #Mathematical Proof That Anime Fans Helped Solve | #ScientificAmerican
#Math #Permutations #Superpermutations #GraphTheory #graph_theory #Salesman_problem #Anime #Haruhi #TheMelancholyOfHaruhiSuzumiya #Fun #Mathematical_proofs #Blogs
head-to-head 型のグラフィカルモデル（\(C→B←A\) 、\(A, C \not \perp B\) とする）をモラル化するさい、A と C の間にリンクを張る必要があるのは、モラルグラフにおいて B を観測した（除いた）場合に A と C が非独立であることを示すためと理解した。
ゲイングラフ (gain graph) は、枝の重み \( \phi(e) \) の集合が群 \( G \) をなすグラフで、隣接行列 \( A_{ij} = \phi (e_{ij}) \) の冪乗 \( A^n \) の元もまた \( G \) に属するという性質を持っている。反対に、符号付きグラフ (signed graph) は群をなさない。
Fiedler 固有値はグラフラプラシアンの下から二番目の固有値を指し、Fiedler 固有値 > 0 であることがグラフが連結であるための必要十分条件であるらしい (知らね〜）
NetworkX Reference
(2016) : Hagberg, Aric Schult, Dan Swar...
url: https://networkx.org/
#graph #reference #technical #graph_theory #networkx #python #my_bibtex
The Why, How, and When of Representations for Complex Systems
(2021) : Torres, Leo et al
DOI: https://doi.org/10.1137/20m1355896
#graph_theory #hypergraph #complex_systems #simplical_complexes #__important #dependency #my_bibtex
Hegel's Logic in the Light of Graph Theory
(1973) : Synowiecki, Adam et al
DOI: https://doi.org/10.5840/dialecticshumanism1973118
#philosophy #geoge_hegel #logic #graph_theory #dialectics #extensional_logic #my_bibtex
Hegel's Logic in the Light of Graph Theory
(1973) : Adam Synowiecki and Krzysztof Kiwiel and John Dickson and Polish Academy of Sciences
DOI: https://doi.org/10.5840/dialecticshumanism1973118
#logic #dialectics #graph_theory #geoge_hegel #philosophy
#my_bibtex
Thinking about manuscript stemmas leads me to thinking about unlabeled graphs, particularly trees. It's clear that we can enumerate the set of unlabeled trees with n nodes: there is a fairly obvious brute-force method. I devoutly hope that someone somewhere has found a better algorithm than generating all the labeled trees and then checking them pairwise for isomorphism - but how to find it? (Similar questions also come up for unrooted undirected trees.) #stemmas #bedier #graph_theory
NetworkX Reference, Release 1.11
(2016) : Aric Hagberg and Dan Schult and Pieter Swart
url: https://networkx.org/
#graph #graph_theory #networkx #python #reference #technical
#my_bibtex
Graphs, Networks and Algorithms
(2005) : Jungnickel, Dieter
DOI: https://doi.org/10.1007/978-3-540-72780-4
#algorithm #circulation #coloring #computer_science #flow #graph #graph_theory #network #simplex
#my_bibtex
Graph-based Interpretation of Normal Logic Programs
(2021) : Fang Li and Elmer Salazar and Gopal Gupta
DOI: https://doi.org/10.48550/ARXIV.2111.13249
#answer_set_programming #graph_theory #logic_programming #stable_model_semantics #well_founded_seman
#my_bibtex
