2 citations · 3 across the 7 of their papers we have counts for
7 papers
The pressure, densities and first order phase transitions associated with multidimensional SOFT
Shmuel Friedland, Uri N. Peled
We study theoretical and computational properties of the pressure function for subshifts of finite type on the integer lattice , multidimensional SOFT, which are called Potts…
On the First Eigenvalue of Bipartite Graphs
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bi…
The Polytope of Dual Degree Partitions
Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on vertices.
Chain Graphs have Unbounded Readability
Martin Charles Golumbic, Uri N. Peled, Udi Rotics
A triangle-free graph is called read- when there exists a monotone Boolean formula whose variables are the vertices of and whose minterms are precisely the edges of…
Alternating Reachability
Amitava Bhattacharya, Uri N. Peled, Murali K. Srinivasan
We consider a graph with colored edges. A trail (vertices may repeat but not edges) is called \emph{alternating} when successive edges have different colors. Given a set of vertice…
Cones of closed alternating walks and trails
Amitava Bhattacharya, Uri N. Peled, Murali K. Srinivasan
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edge…