منابع مشابه
Labelling Wheels for Minimum Sum Number
A simple undirected graph G is called a sum graph if there exists a labelling L of the vertices of G into distinct positive integers such that any two distinct vertices u and v of G are adjacent if and only if there is a vertex w whose label L(w) = L(u) + L(v). It is obvious that every sum graph has at least one isolated vertex, namely the vertex with the largest label. The sum number (H) of a ...
متن کاملPolygon labelling of minimum leader length
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have minimum total length. We present an O(n lo...
متن کاملPoint of Minimum Temperature
A homogeneous convex centrosymmetric body with constant thermal properties is initially at temperature zero and its boundary is maintained at a temperature Tb > 0. Prove or disprove that at any time t > 0, the point of minimum temperature is the center. Also, prove or disprove that the isothermal surfaces are convex and centrosymmetric. Note that the convexity of the isothermal surfaces will im...
متن کاملHeuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
Given a graph G with a label (color) assigned to each edge (not necessarily properly) we look for an hamiltonian cycle of G with the minimum number of different colors. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity or other properties by means of limited number of dif...
متن کاملOn the Minimum Labelling Spanning bi-Connected Subgraph problem
We introduce the minimum labelling spanning bi-connected subgraph problem (MLSBP) replacing connectivity by bi-connectivity in the well known minimum labelling spanning tree problem (MLSTP). A graph is bi-connected if, for every two vertices, there are, at least, two vertex-disjoint paths joining them. The problem consists in finding the spanning bi-connected subgraph or block with minimum set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2020
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556788.2020.1833880