ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Computing
Education
Physical
Research
Economy
Pure sciences
Social Sciences
all records (67)

Languages
English
Spanish
German
Portuguese
French

Countries
Australia
Indonesia
USA
Chile
Brazil
Ukraine
Italy
Turkey, Turkish Republic
Romania
India
all records (58)

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

Filter  
 
2.410  Articles
1 of 241 pages  |  10  records  |  more records»
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

Let s and k be positive integers with k = 2 and G1, G2, …, Gk be simple graphs. The set multipartite Ramsey number, denoted by Ms(G1, G2, …, Gk), is the smallest positive integer c such that any&... see more

Let c : V(G)?{1, 2, …, k} be a proper k-coloring of a simple connected graph G. Let ? = {C1, C2, …, Ck} be a partition of V(G), where Ci is the set of vertices of G receiving color i. The color c... see more

Abstract: Let the star on n vertices, namely K1, n - 1 be denoted by Sn. If every two coloring of the edges of a complete balanced multipartite graph Kj × s there is a copy of Sn in the first color or a copy of... see more

Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004. They have also determined the necessary and sufficient condit... see more

We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separabi... see more

A well-known conjecture of Richard Stanley posits that the hh-vector of the independence complex of a matroid is a pure O{\mathcal O}-sequence. The conjecture has been established for various classes but is open for graphic matroids. A biconed graph is a ... see more

The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.

This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts are not all of size 1, so the graph is not K_n ), in the case that the cycle lengths are “small”. Cycles up to length n are considered, when the complete m... see more

1 of 241 pages  |  10  records  |  more records»