ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Social Sciences
Research
Architecture and Urbanism
Literature
Languages
Computing
all records (76)

Languages
English
Spanish
Portuguese
German
French
Finnish

Countries
Indonesia
Brazil
USA
Australia
Ukraine
Chile
Italy
Cuba
Spain
Poland
all records (79)

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

Filter  
 
23.870  Articles
1 of 2.387 pages  |  10  records  |  more records»
All regular two-graphs having up to 36 vertices are known, and the first open case is the enumeration of two-graphs on 38 vertices. It is known that there are at least 191 regular two-graphs on 38 vertices and at least 18 regular two-graphs on 42 vertices... see more

A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V ? {1, 2, …, n} with the property that f(xi)=i, the weight w(xi) is the sum of labels of all neigh... see more

A cubic graph is a generalized structure of a fuzzy graph that gives moreprecision, flexibility and compatibility to a system when compared with systems thatare designed using fuzzy graphs. In this paper, some properties of an edge regularcubic graph are ... see more

Let ?? = (??, ??) be a graph. A total labeling ??: ?? ? ?? ? {1, 2, ? , ??} iscalled a totally irregular total ??-labeling of ?? if every two distinct vertices ?? and?? in ?? satisfy ????(??) ? ????(??) and every two distinct edges ??1??2 and ??1??2 in ??... see more

We prove that a distance-regular graph with intersection array {22,16,5;1,2,20} does not exist. To prove this, we assume that such a graph exists and derive some combinatorial properties of its local graph. Then we construct a partial linear space from th... see more

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs sinc... see more

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many p... see more

We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and w... see more

A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f - 2 of which are of size d and the remaining two are of sizes d1, d2, both different from d. Such a graph is ca... see more

1 of 2.387 pages  |  10  records  |  more records»