搜索结果: 1-5 共查到“模糊数学 Graphs”相关记录5条 . 查询时间(0.031 秒)
Polynomial invariants of graphs on surfaces
Graphs on surfaces ribbon graphs matroids Krushkal polynomial
font style='font-size:12px;'>
2011/2/25
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. ...
On the edit distance from $K_{2,t}$-free graphs II: Cases $t\geq 5$
edit distance quadratic programming strongly regular graphs
font style='font-size:12px;'>
2011/1/18
The edit distance between two graphs on the same vertex set is defined to be size of the symmetric difference of their edge sets. The edit distance function of a hereditary property,
H, is a function...
On the edit distance from $K_{2,t}$-free graphs I: Cases $t=3,4$
edit distance quadratic programming strongly regular graphs
font style='font-size:12px;'>
2011/1/18
The edit distance between two graphs on the same vertex set is defined to be size of the symmetric difference of their edge sets. The edit distance function of a hereditary property, H,is a function o...
SO(3) Homology of Graphs and Links
SO(3) Homology of Graphs Links
font style='font-size:12px;'>
2011/2/22
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of ...
Chip-Firing and Riemann-Roch Theory for Directed Graphs
Chip-Firing Riemann-Roch Theory Directed Graphs
font style='font-size:12px;'>
2011/1/17
We investigate Riemann-Roch theory for directed graphs. The Riemann-Roch criteria of Amini and
Manjunath is generalized to all integer lattices orthogonal to some positive vector. Using a generalized...