Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding (NOBE), whichâ€¦ (More)

A graph G is uniquely k-colorable if the chromatic number of G is k and G has only one k-coloring up to permutation of the colors. A uniquely k-colorable graph G is edge-critical if G âˆ’ e is not aâ€¦ (More)

The semitotal domination number of a graph G without isolated vertices is theminimum cardinality of a set S of vertices ofG such that every vertex in V (G)\S is adjacent to at least one vertex in S,â€¦ (More)

The Smarandachely adjacent-vertex total chromatic number of graph G is the smallest positive integer k for which G has a proper total k-coloring such that for any pair of adjacent vertices u, v, theâ€¦ (More)

2009 2nd International Conference on Biomedicalâ€¦

2009

Let G(V,E) be a simple graph,k (1 â‰¤ k â‰¤ âˆ† + 1) is a positive integer. f is a mapping from V (G) âˆª E(G) to {1, 2, . . . , k} such that âˆ€uv, uw âˆˆ E(G), v 6= w, f(uv) 6= f(uw);âˆ€uv âˆˆ E(G) , if d(u) =â€¦ (More)

IEEE Transactions on Neural Networks and Learningâ€¦

2018

The decision-making process, which is regarded as cognitive and ubiquitous, has been exploited in diverse fields, such as psychology, economics, and artificial intelligence. This paper considers theâ€¦ (More)