The eccentric connectivity index ξ is a novel distance–based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. It is defined as ξ(G) = ∑ v∈V (G) deg(v) · ε(v) , where deg(v) and ε(v) denote the vertex degree and eccentricity of v , respectively. We survey some mathematical properties of this index and furthermore support ...

We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple graphs declaring the allowed or forbidden relationships between source and target models. In this way, a transformation is defined by specifying a set of triple graph constraints that should be satisfied by the result ...

In this paper, we incorporate shape detection into contextual scene labeling and make use of both shape, texture, and context information in a graphical representation. We propose a candidacy graph, whose vertices are two types of recognition candidates for either a superpixel or a window patch. The superpixel candidates are generated by a discriminative classifier with textural features as wel...

In this paper, we present a preliminary approach for automatically discovering the topics of a structured data source with respect to a reference ontology. Our technique relies on a signature, i.e., a weighted graph that summarizes the content of a source. Graph-based approaches have been already used in the literature for similar purposes. In these proposals, the weights are typically assigned...

We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple graphs declaring the allowed or forbidden relationships between source and target models. In this way, a transformation is defined by specifying a set of triple graph constraints that should be satisfied by the result ...

The commuting graph of a group G, denoted by Γ(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Zm be the commutative ring of equivalence classes of integers modulo m. In this paper we investigate the connectivity and diameters of the commuting graphs of GL(n,Zm) to contribute to the conje...

This paper develops an effective, cooperative, and probabilistically-complete multi-robot motion planner. The approach takes into account geometric and differential constraints imposed by the obstacles and the robot dynamics by using sampling to expand a motion tree in the composite state space of all the robots. Scalability and efficiency is achieved by using solutions to a simplified problem ...

We propose a distributed first-order augmented Lagrangian (DFAL) algorithm to minimize the sum of composite convex functions, where each term in the sum is a private cost function belonging to a node, and only nodes connected by an edge can directly communicate with each other. This optimization model abstracts a number of applications in distributed sensing and machine learning. We show that a...

Let G be a group. Denote by π(G) the set of prime divisors of |G|. Let GK(G) be the graph with vertex set π(G) such that two primes p and q in π(G) are joined by an edge if G has an element of order p · q. We set s(G) to denote the number of connected components of the prime graph GK(G). Denote by N(G) the set of nonidentity orders of conjugacy classes of elements in G. Alavi and Daneshkhah pro...

Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the promise of reducing an inequality-constrained problem to an equality-constrained problem, in a neighborhood of a solution. We study this issue in the more general setting of composite nonsmooth minimization, in which the objective is a composition of a ...