Description of the Triangle-free Prime Graphs Having at Most Two Non Critical Vertices.
Imed BoudabbousWalid MarweniPublished in: J. Multiple Valued Log. Soft Comput. (2020)
Keyphrases
- structural descriptions
- weighted graph
- undirected graph
- attributed graphs
- random graphs
- labeled graphs
- adjacency matrix
- planar graphs
- maximal cliques
- directed graph
- graph theory
- hamiltonian cycle
- triangle mesh
- average degree
- connected subgraphs
- graph representation
- edge weights
- vertex set
- directed edges
- graph theoretic
- graph mining
- graph clustering
- complex structures
- data sets
- spanning tree
- graph databases
- graph structure
- structured objects
- bipartite graph
- phase transition
- shortest path
- random walk
- maximum cardinality
- connected graphs
- real time