ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Mathematics
Agronomy and forestry
Biology
Computing
Social Sciences
Research
Languages
Computing
all records (74)

Languages
English
Spanish
French
Portuguese
German
Finnish

Countries
Indonesia
USA
Australia
Brazil
Ukraine
Italy
South Africa
Chile
Romania
Austria
all records (73)

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

Filter  
 
39.143  Articles
1 of 3.915 pages  |  10  records  |  more records»
Graph embedding is a powerful method in parallel computing that maps a guest network G into a host network H. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion, and the wirelength. In th... see more

A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling ? : V ? E? 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y)... see more

Let G be a simple and finite graph. A graph is said to be decomposed into subgraphs H1 and H2 which is denoted by G = H1 ? H2, if G is the edge disjoint union of H1 and H2. If G = H1 ? H2 ? H3 ? ... ? Hk, where H1, H2, H3, ..., Hk are all isomor... see more

The g-girth-thickness ?(g, G) of a graph G is the smallest number of planar subgraphs of girth at least g whose union is G. In this paper, we calculate the 4-girth-thickness ?(4, G) of the complete m-partite graph G when each part has an even number of ve... see more

Graph products and the corresponding spectra are often studied in the literature. A special attention has been given to the wreath product of two graphs, which is derived from the homonymous product of groups. Despite a general formula for ... see more

We use Rosa-type labelings to decompose complete graphs into unicyclic, disconnected, bipartite graphs on nine edges – namely, those featuring cyclic component C4, C6, or C8. For any such graph H, we prove there exists an H-design... see more

For a graph G G , a monotone increasing graph property P \mathcal{P} and positive integer q q , we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is offering Client a subset of at least one and at most q+... see more

A finite graph G\Gamma is GG-symmetric if it admits GG as a group of automorphisms acting transitively on V(G)V(\Gamma) and transitively on the set of ordered pairs of adjacent vertices of G\Gamma. If V(G)V(\Gamma) admits a nontrivial GG-invariant partiti... see more

It is shown that if GG is any bipartite 2-regular graph of order at most n/2n/2 or at least n-2n-2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order nn into a perfect matching and edg... see more

1 of 3.915 pages  |  10  records  |  more records»