ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Computing
Biology
Agronomy and forestry
Research
Chemistry
Pure sciences
Environment
all records (62)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Australia
Brazil
Chile
Ukraine
Italy
Switzerland
Denmark
Spain
all records (61)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
2.028  Articles
1 of 204 pages  |  10  records  |  more records»
In 2007 Matamala proved that if G is a simple graph with maximum degree ? = 3 not containing K?+1 as a subgraph and s, t are positive integers such that s+t = ?, then the vertex set of G admits a partition (S,T) such that G[S] is a maximum order (s-1... see more

Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the represen... see more

For a graph G=(V,E), a partition O={O1,O2,…,Ok} of the vertex set V is called a resolving partition if every pair of vertices u,v ? V(G) have distinct representations under O. The partition dimension of G is the minimum integer k such that G has a resolvi... see more

Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the represen... see more

On buffer zone construction, the rasterization-based dilation method inevitablyintroduces errors, and the double-sided parallel line method involves a series ofcomplex operations. In this paper, we proposed a parallel buffer algorithm based onarea merging... see more

A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a nice drawing of its dual, that is, a straight-line embedding of it such that ea... see more

Let G = (V, E) be a graph of order n = |V| and chromatic number (G) A dominating set D of G is called a dominating chromatic partition-cover or dcc-set, if it intersects every color class of every X-coloring of G. The minimum cardinality of a dcc-set is c... see more

In 2008 Amanatidis, Green and Mihail introduced the Joint Degree Matrix (JDM) model to capture the fundamental difference in assortativity of networks in nature studied by the physical and life sciences and social networks studied in the social sciences.&... see more

A bipartite graph G(X,Y,E)G(X,Y,E) with vertex partition (X,Y)(X,Y) is said to have the Normalized Matching Property (NMP) if for any subset S?XS\subseteq X we have |N(S)||Y|=|S||X|\frac{|N(S)|}{|Y|}\geq\frac{|S|}{|X|}. In this paper, we prove the followi... see more

1 of 204 pages  |  10  records  |  more records»