Neither external nor internal to finance, the financial imagination marks out a space where theoretical and practical aspects of finance come together in inner life subject. That means there is something about subjectivity that escapes functional view on imagination. The purpose this forum probe contours terms its perimeters blind spots, fantasies delusions.

Recently Cutler and Radcliffe proved that the graph on $n$ vertices with maximum degree at most $r$ having cliques is a disjoint union of $\lfloor n/(r+1)\rfloor$ size $r+1$ together clique remainder vertices. It very natural also to consider this question when limiting resource edges rather than In paper we prove among graphs $m$ $r$, has least two $\bigl\lfloor m \bigm/\binom{r+1}{2} \bigr\rf...

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

We prove that Hadwiger’s conjecture holds for line graphs. Equivalently, we show that for every loopless graph G (possibly with parallel edges) and every integer k ≥ 0, either G is k-edge-colourable, or there are k + 1 connected subgraphs A1, ..., Ak+1 of G, each with at least one edge, such that E(Ai ∩ Aj) = ∅ and V (Ai ∩ Aj) 6= ∅ for 1 ≤ i < j ≤ k.

We consider only finite undirected graphs without loops or multiple edges. Our terminology is standard except as indicated. A good reference for any undefined terms is [4]. We begin by introducing some definitions and convenient notation. The set of vertices of a graph G is denoted by V(G) or just V; the set of edges by E(G) or just E. We use K for the connectivity of a graph, and c1 to denote ...

Blood vessel segmentation from the retinal images is extremely important for assessing retinal abnormalities. A good amount of research has been reported on blood vessel segmentation, but significant improvement is still a necessity particularly on minor vessel segmentation. As the local contrast of blood vessels is unstable (intensity variation), especially in unhealthy retinal images, it beco...

A topology is efficient for network games if, for any game over it, every Nash equilibrium is socially optimal. It is well known that many topologies are not efficient for network games. We characterize efficient topologies in network games with a finite set of players, each wishing to transmit an atomic unit of unsplittable flow. We distinguish between two classes of atomic network routing gam...

We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics, and so allowing graphs with multivariate edges significantly increases modeling power. In this context the clustering problem becomes more challenging. Each edge/metric provides only partial information about the data; recovering full inform...