Results 31 to 40 of about 2,201 (118)
A proper total coloring distinguishing adjacent vertices by sums of some product graphs
, 2014 In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak \cite{PW}
Choi, Hana +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 +8 more
core
On the neighbour sum distinguishing index of planar graphs
, 2016 Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating irregularities in
Bonamy, Marthe, Przybyło, Jakub
core +4 more sources
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 +6 more
core +1 more source
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 +2 more
openaire +2 more sources
Exact bosonization of the Ising model [PDF]
, 2011 We present exact combinatorial versions of bosonization identities, which equate the product of two Ising correlators with a free field (bosonic) correlator.
Dubédat, Julien
core
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
Restriction of the Global IgM Repertoire in Antiphospholipid Syndrome. [PDF]
Front Immunol, 2022 Pashova S +7 more
europepmc +1 more source
Adjacent-vertex-distinguishing total coloring of indifference graphs
Matemática Contemporânea, 2010 Vagner Pedrotti, Célia de Mello
openaire +1 more source
Machine learning of atomic dynamics and statistical surface identities in gold nanoparticles. [PDF]
Commun Chem, 2023 Rapetti D +5 more
europepmc +1 more source