Transactions on Combinatorics (TOC) - Keyword Index

• Home
• Browse
  • Current Issue
  • By Issue
  • By Author
  • By Subject
  • Author Index
  • Keyword Index
• Submit Paper
• Journal Info
  • About Journal
  • Aims and Scope
  • Editorial Board
  • Advisory Editorial Board
  • Editorial Office
  • Indexing Databases
  • Related Links
  • FAQ
  • Peer Review Process
  • News
• Guide for Authors
• Reviewers
• Contact Us

 

• Login
• Register

Home Keyword Index A B C D E F G H I J K L M N O P Q R S T U V W X Y Z  A B Balance; Volume 1, Number 3, 2012 Balance; Volume 2, Number 1, 2013 C Cartesian product; Volume 1, Number 3, 2012 Choosability; Volume 1, Number 3, 2012 CN-Minimal Dominating (Graph); Volume 1, Number 1, 2012 Code; Volume 2, Number 1, 2013 Colorful Directed Paths; Volume 2, Number 2, 2013 Common minimal $CN$-dominating signed graph; Volume 2, Number 1, 2013 Common minimal dominating signed graph; Volume 1, Number 3, 2012 Computational Complexity; Volume 2, Number 2, 2013 Conflicting objectives; Volume 2, Number 1, 2013 Corona; Volume 1, Number 4, 2012 Corona product; Volume 1, Number 4, 2012 D Decomposition; Volume 1, Number 4, 2012 Determinant; Volume 1, Number 4, 2012 Diameter; Volume 1, Number 3, 2012 Domination polynomial; Volume 1, Number 2, 2012 E Eccentric connectivity index; Volume 2, Number 1, 2013 Edge distance-balanced; Volume 1, Number 1, 2012 Eigenvalue; Volume 1, Number 3, 2012 Eulerian; Volume 1, Number 2, 2012 F Finite group; Volume 2, Number 1, 2013 Finite groups; Volume 1, Number 2, 2012 Friendly labeling; Volume 1, Number 1, 2012 G Graph; Volume 1, Number 3, 2012 Graphoidal labeling; Volume 1, Number 4, 2012 Gray map; Volume 2, Number 1, 2013 H Hamilton-connectedness; Volume 1, Number 3, 2012 Hamilton cycle; Volume 1, Number 3, 2012 Hamiltonian cycle; Volume 1, Number 1, 2012 Hamilton path; Volume 1, Number 3, 2012 Hosoya; Volume 1, Number 4, 2012 Hosoya index; Volume 1, Number 4, 2012 I Independence polynomial; Volume 1, Number 2, 2012 Integral circulant graph; Volume 1, Number 3, 2012 Isometry; Volume 2, Number 1, 2013 J K L L(2, 1)-labeling; Volume 1, Number 3, 2012 Label graphoidal covering number; Volume 1, Number 4, 2012 Label graphoidal graph; Volume 1, Number 4, 2012 Laplacian energy; Volume 2, Number 1, 2013 LDPC codes; Volume 1, Number 2, 2012 LDPC codes; Volume 2, Number 2, 2013 Link of two graphs; Volume 1, Number 4, 2012 M Matching; Volume 1, Number 4, 2012 Merrifield-Simmons index; Volume 1, Number 4, 2012 Merrifield-Simmons index; Volume 1, Number 4, 2012 Multi-Objective Particle Swarm Optimization; Volume 2, Number 1, 2013 N Negation; Volume 2, Number 1, 2013 Neighborhood signed graph; Volume 1, Number 3, 2012 Non-dominated solutions; Volume 2, Number 1, 2013 O Order difference interval graph; Volume 1, Number 2, 2012 P Pareto optimal set; Volume 2, Number 1, 2013 Particle Swarm Optimization; Volume 2, Number 1, 2013 Q R Regular graph; Volume 1, Number 1, 2012 Regular graph; Volume 1, Number 4, 2012 Resistance distance (in graph); Volume 1, Number 2, 2012 S Signed graphs; Volume 1, Number 3, 2012 Signed graphs; Volume 2, Number 1, 2013 Spectral clustering algorithms; Volume 1, Number 1, 2012 Supercritical; Volume 1, Number 3, 2012 Switching; Volume 1, Number 3, 2012 Switching; Volume 2, Number 1, 2013 Szeged index; Volume 1, Number 4, 2012 T Tanner graph; Volume 1, Number 2, 2012 Toeplitz graph; Volume 1, Number 4, 2012 Total domination; Volume 1, Number 3, 2012 Travelling Salesman Problem; Volume 1, Number 1, 2012 U Unicyclic graph; Volume 1, Number 2, 2012 V Value; Volume 1, Number 2, 2012 Vertex Coloring; Volume 2, Number 2, 2013 W Wiener index; Volume 1, Number 4, 2012 X Y Z

Home | Glossary | Aims and Scope | Sitemap

Top

© 2013 All Rights Reserved. Powered by SINAWEB.