Results 31 to 40 of about 445,292 (276)
Chromatic number is Ramsey distinguishing [PDF]
Journal of Graph Theory, 2021 AbstractA graph is Ramsey for a graph if every colouring of the edges of in two colours contains a monochromatic copy of . Two graphs and are Ramsey equivalent if any graph is Ramsey for if and only if it is Ramsey for . A graph parameter is Ramsey distinguishing if implies that and are not Ramsey equivalent.
openaire +2 more sources
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
Well-quasi-ordering and finite distinguishing number [PDF]
, 2020 Balogh, Bollobás and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary classes of graphs at the sequence of Bell numbers.
Robert Brignall +3 more
core +1 more source
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source
Distinguishing chromatic number of Hamiltonian circulant graphs [PDF]
, 2023 The distinguishing chromatic number of a graph $G$ is the smallest number of colors needed to properly color the vertices of $G$ so that the trivial automorphism is the only symmetry of $G$ that preserves the coloring.
Barrus, Michael D. +2 more
core +1 more source
Impact of factor rotation on Q-methodology analysis
PLoS ONE, 2023 The Varimax and manual rotations are commonly used for factor rotation in Q-methodology; however, their effects on the results may not be well known.
Noori Akhtar-Danesh
doaj +3 more sources
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
Electronic Journal of Graph Theory and Applications, 2022 The edge-distinguishing chromatic number (EDCN) of a graph G is the minimum positive integer k such that there exists a vertex coloring c : V(G)→{1, 2, …, k} whose induced edge labels {c(u),c(v)} are distinct for all edges uv.
Grant Fickes, Wing Hong Tony Wong
doaj +1 more source
Relations between the distinguishing number and some other graph parameters [PDF]
ریاضی و جامعهA distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi +1 more
doaj +1 more source
The distinguishing number of quasiprimitive and semiprimitive groups [PDF]
, 2019 The distinguishing number of G⩽ Sym (Ω) is the smallest size of a partition of Ω such that only the identity of G fixes all the parts of the partition. Extending earlier results of Cameron, Neumann, Saxl, and Seress on the distinguishing number of finite
Harper, Scott; id_orcid +3 more
core +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source