Distant total irregularity strength of graphs via random vertex ordering.
Jakub PrzybyloPublished in: Discret. Math. (2018)
Keyphrases
- undirected graph
- labeled graphs
- directed graph
- attributed graphs
- hamiltonian cycle
- graph theory
- maximum cardinality
- connected subgraphs
- graph matching
- vertex set
- graph theoretic
- graph representation
- edge weights
- data sets
- uniformly distributed
- spanning tree
- graph kernels
- series parallel
- graph mining
- fractal dimension
- partial order
- social network analysis
- lower bound
- genetic algorithm