Results 31 to 40 of about 2,185 (126)

Sigma Partitioning: Complexity and Random Graphs

, 2018
A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The
Ahadi, Arash, Dehghan, Ali, Sadeghi, Mohammad-Reza   +2 more
core   +1 more source

Adjacent vertex distinguishing total coloring of corona product of graphs

Ars Mathematica Contemporanea
An adjacent vertex distinguishing total $k$-coloring $f$ of a graph $G$ is a proper total $k$-coloring of $G$ such that no pair of adjacent vertices has the same color sets, where the color set at a vertex $v$, $C^G_f(v)$, is $\{f(v)\} \cup \{f(vu)|u \in V (G), vu \in E(G)\}$. In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph $
Furmańczyk, Hanna, Zuazua, Rita
openaire   +3 more sources

Distinguishing Chromatic Number of Random Cayley graphs

, 2016
The \textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\chi_D(G)$, was first defined in \cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\phi$ of the graph $G$ fixes each ...
Balachandran, Niranjan, Padinhatteeri, Sajith   +1 more
core   +1 more source

Stackelberg Network Pricing is Hard to Approximate

, 2008
In the Stackelberg Network Pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path
Bouhtou, Demaine, Feige, Kierstead, Labbé, Roch, Roughgarden   +6 more
core   +1 more source

Graph Colorings with Constraints [PDF]

, 2010
A graph is a collection of vertices and edges, often represented by points and connecting lines in the plane. A proper coloring of the graph assigns colors to the vertices, edges, or both so that proximal elements are assigned distinct colors.
Hulgan, Jonathan Darren
core   +1 more source

Breaking Instance-Independent Symmetries In Exact Graph Coloring

, 2011
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning,
Aloul, F. A., Markov, I. L., Ramani, A., Sakallah, K. A.   +3 more
core   +1 more source

Hipergráfok = Hypergraphs [PDF]

, 2010
A projekt célkitűzéseit sikerült megvalósítani. A négy év során több mint száz kiváló eredmény született, amiből eddig 84 dolgozat jelent meg a téma legkiválóbb folyóirataiban, mint Combinatorica, Journal of Combinatorial Theory, Journal of Graph Theory,
Elek, Gábor, Erdős, Péter, Győri, Ervin, Katona, Gyula, Sali, Attila, Simonovits, Miklós, Simonyi, Gábor, Szemerédi, Endre, Tardos, Gábor   +8 more
core  

Adjacent vertex distinguishing total coloring of 3-degenerate graphs

A total coloring of a simple undirected graph $G$ is an assignment of colors to its vertices and edges such that the colors given to the vertices form a proper vertex coloring, the colors given to the edges form a proper edge coloring, and the color of every edge is different from that of its two endpoints. That is, $ϕ:V(G)\cup E(G)\rightarrow\mathbb{N}
Behera, Diptimaya, Francis, Mathew C., Pallathumadam, Sreejith K.   +2 more
openaire   +2 more sources

Restriction of the Global IgM Repertoire in Antiphospholipid Syndrome. [PDF]

Front Immunol, 2022
Pashova S, Balabanski L, Elmadjian G, Savov A, Stoyanova E, Shivarov V, Petrov P, Pashov A.   +7 more
europepmc   +1 more source

Machine learning of atomic dynamics and statistical surface identities in gold nanoparticles. [PDF]

Commun Chem, 2023
Rapetti D, Delle Piane M, Cioni M, Polino D, Ferrando R, Pavan GM.   +5 more
europepmc   +1 more source