Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
Kaleidoscopic Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2017 For an r-regular graph G, let c : E(G) → [k] = {1, 2, . . . , k}, k ≥ 3, be an edge coloring of G, where every vertex of G is incident with at least one edge of each color.
Chartrand Gary, English Sean, Zhang Ping
doaj +1 more source
Distance-based topological polynomials and indices of friendship graphs. [PDF]
Springerplus, 2016 Gao W +3 more
europepmc +1 more source
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. [PDF]
Math Program, 2018 Gribling S, de Laat D, Laurent M.
europepmc +1 more source
Diversity of capsular polysaccharide gene clusters in Kpc-producing Klebsiella pneumoniae clinical isolates of sequence type 258 involved in the Italian epidemic. [PDF]
PLoS One, 2014 D'Andrea MM +7 more
europepmc +1 more source
A Graph Coloring Algorithm for Large Scheduling Problems. [PDF]
J Res Natl Bur Stand (1977), 1979 Leighton FT.
europepmc +1 more source
Further results on the radio number for some construction of the path, complete, and complete bipartite graphs. [PDF]
HeliyonMari B, Jeyaraj RS.
europepmc +1 more source
Computing dominant metric dimensions of certain connected networks. [PDF]
HeliyonAli I, Javaid M, Shang Y.
europepmc +1 more source