On some formulas in combinatorial computation of uni-trivalent graphs

zbMATH Open1113.57003MaRDI QIDQ876795FDOQ876795

Ken'ichi Kuga, Kazutaka Hanawa

Publication date: 30 April 2007

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3847418
• Computing the vertex separation of unicyclic graphs
• On unicyclic non-bipartite graphs with tricyclic inverses
• Some results on the index of unicyclic graphs
• Formulas for the computation of the Tutte polynomial of graphs with parallel classes
• Unicyclic graphs with equal domination and complementary tree domination numbers
• Composition of graphs and the triangle-free subgraph polytope
• A generalization of Villarreal's result for unmixed tripartite graphs
• On unimodular graphs
• The Kauffman polynomial and trivalent graphs

zbMATH Keywords

weight systemsimple Lie algebrasuni-trivalent graphsVassiliev-Kontsevich invariants

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Lie algebras and Lie superalgebras (17B99)

This page was built for publication: On some formulas in combinatorial computation of uni-trivalent graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876795)