Related papers: Free divisors on metric graphs
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by…
M{\o}ller maps are identifications between the observables of a perturbatively interacting physical system and the observables of its underlying free (i.e. non-interacting) system. This work studies and characterizes obstructions to the…
We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4,…
One deals with arbitrary reduced free divisors in a polynomial ring over a field of characteristic zero, by stressing the ideal theoretic and homological behavior of the corresponding singular locus. A particular emphasis is given to both…
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…
We study the existence of a Zsigmondy bound for a sequence of divisors associated to points on an elliptic curve over a function field. More precisely, let $k$ be an algebraically closed field, let $\mathcal{C}$ be a nonsingular projective…
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
The discriminant power of centrality indices for the degree, eigenvector, closeness, betweenness and subgraph centrality is analyzed. It is defined by the number of graphs for which the standard deviation of the centrality of its nodes is…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions based on edge cuts instead of vertex cuts which we call…
A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. Following analogous studies in the literature related to independent sets, dominating sets, and total dominating sets, we study in this…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…
The non-isomorphic locus of a general projection from an embedded smooth projective variety to a hypersurface moves in a linear system of an effective divisor which we call the double point divisor. David Mumford proved that the double…
Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…
Let $\mathcal{F}$ be a family of fixed graphs and let $d$ be large enough. For every $d$-regular graph $G$, we study the existence of a spanning $\mathcal{F}$-free subgraph of $G$ with large minimum degree. This problem is well-understood…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
In this note, we extend work of Farkas and Rim\'anyi on applying quadric rank loci to finding divisors of small slope on the moduli space of curves by instead considering all divisorial conditions on the hypersurfaces of a fixed degree…
Let $C$ be a smooth plane curve of degree $d$ defined over an algebraically closed field $k$. A base point free complete very special linear system $g^r_n$ on $C$ is trivial if there exists an integer $m\ge 0$ and an effective divisor $E$…