ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Education
Computing
Social Sciences
Research
Pure sciences
Physical
Public health
all records (71)

Languages
English
Spanish
Portuguese
German
French

Countries
Australia
Indonesia
USA
Brazil
Chile
Cuba
Ukraine
Italy
South Africa
India
all records (61)

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

Filter  
 
2.889  Articles
1 of 290 pages  |  10  records  |  more records»
Let G = (V(G),E(G)) be a graph with the nonempty vertex set V(G) and the edge set E(G). Let Zn be the group of integers modulo n and let k be a positive integer. A modular irregular labeling of a grap... see more


Let G and H be two given graphs. The notation F?(G,H) means that any red-blue coloring on the edges of F will create either a red subgraph G or a blue subgraph H in F. A graph F is a Ramsey (G,H)-minimal graph if F satisfies two conditions: (1) F?(G,H), a... 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

Let G = (V, E) be a simple undirected graph. A labeling f : V(G)?{1, …, k} is a local inclusive d-distance vertex irregular labeling of G if every adjacent vertices x, y ? V(G) have distinct weights, with the w... see more

In this paper, the vertex-degree function index Hf(G) is considered when function f(x) belongs to four classes of functions determined by the following properties: strictly convex versus strictly concave and strictly increasing versus ... see more

Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k-labeling ? such that the vertices of graph G are labeled with {0, 2, 4, . . . , 2kv} a... see more

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube QdQ_d to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is no... see more

This short note proves that every non-complete kk-list-critical graph has average degree at least k-1+k-3k2-2k+2k-1 + \frac{k-3}{k^2-2k+2}. This improves the best known bound for k=4,5,6k = 4,5,6. The same bound holds for online kk-list-critical graphs.

1 of 290 pages  |  10  records  |  more records»