Results 61 to 70 of about 140,706 (235)
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups [PDF]
, 2021 J. Pascal Gollin +4 more
openalex +1 more source
Good edge-labelling of graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araujo, Julio +3 more
openaire +3 more sources
Cyclic labellings with constraints at two distances [PDF]
, 2004 Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with non-negative integers. The objective is to minimise the span of the labelling, subject to constraints imposed at graph distances one and two.
Leese, R, Noble, S D
core +1 more source
Semi-supervised graph labelling reveals increasing partisanship in the United States Congress
Applied Network Science, 2019 Graph labelling is a key activity of network science, with broad practical applications, and close relations to other network science tasks, such as community detection and clustering. While a large body of work exists on both unsupervised and supervised
Max Glonek +3 more
doaj +1 more source
, 2006 We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph.
Braunstein, Samuel L. +2 more
core +2 more sources
Swapping Labeled Tokens on Graphs [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamanaka, Katsuhisa +9 more
openaire +6 more sources
Greedy MAXCUT Algorithms and their Information Content
, 2016 MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem.
Bian, Yatao +2 more
core +1 more source
Radio labelings of distance graphs [PDF]
Discrete Applied Mathematics, 2013 A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x) - c(y)| \geq k+1 - d(x,y),$$ for any two vertices $x$ and $y$, $x\ne y$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio labelings of distance graphs, i.e., graphs with the set $\Z$
Čada, Roman +3 more
openaire +3 more sources
Further results on edge irregularity strength of graphs
Indonesian Journal of Combinatorics, 2017 A vertex $k$-labelling $\phi:V(G)\longrightarrow \{1,2,\ldots,k\}$ is called irregular $k$-labeling of the graph $G$ if for every two different edges $e$ and $f$, there is $w_{\phi}(e)\neq w_{\phi}(f)$; where the weight of an edge is given by $e=xy\in E ...
Muhammad Imran +3 more
doaj +1 more source
Random Information Spread in Networks [PDF]
, 2010 Let G=(V,E) be an undirected loopless graph with possible parallel edges and s and t be two vertices of G. Assume that vertex s is labelled at the initial time step and that every labelled vertex copies its labelling to neighbouring vertices along edges ...
Lapus, Raymond +2 more
core +1 more source