ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Computing
Technology
Administration - Business
Computing
Biology
Social Sciences
Economy
Education
Architecture and Urbanism
all records (13)

Languages
English

Countries
Indonesia
Australia
USA
Ecuador
Czech Republic
Ukraine
Chile
Denmark
Norway
Poland

Years
2023
2020
2019
2018
2017
2016
2015
2011
2008

Filter  
 
24  Articles
1 of 3 pages  |  10  records  |  more records»
Let G\Gamma be an antipodal distance-regular graph with diameter 44 and eigenvalues ?0>?1>?2>?3>?4\theta_0>\theta_1>\theta_2>\theta_3>\theta_4. Then G\Gamma is tight in the sense of Jurišic, Koolen, and Terwilliger (J. Algebraic Combin, 2000) ... see more

Resolving partition is part of graph theory. Resolving partition is needed to obtain partition dimension. So far it has not been discussed regarding resolving partition of complete graphs. For this reason, this article explains the resolving partition of ... see more

We study drawings of planar graphs where every inner face has a prescribed area. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the assigned areas. The only non-area-univer... see more

The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-lin... see more

We describe a framework for constructing data structures which allow fast counting and enumeration of various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count tria... see more

Context. Effective solution of a large number of applications requires optimal transportation. Construction of optimal routes ona static in time graph describing a network of roads is a classic and detailed study of tasks. However, in many applications, t... see more

By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory, this paper shows that the task on establishing a maximal matching in an arbitrary graph can be reduced to its bipartite case. It has been proven that each... see more

Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be skolem odd difference mean if there exists a function f : V(G) ? {0, 1, 2, 3,...,p+3q — 3} satisfying f is 1-1 and the induced map f * : E(G) ?{1, 3, 5,..., 2q-1} def... see more

Hotsko Oksana, Galaychuk Igor. Spectral Analysis of Digital Images as a New Method in Diagnosis of Malignant Melanoma. Journal of Education, Health and Sport. 2015;5(10):340-349. ISSN 2391-8306. DOIhttp://dx.doi.org/10.5281/zenodo.42599http://ojs.ukw.edu.... see more

1 of 3 pages  |  10  records  |  more records»