ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

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

Languages
English
Spanish
Portuguese
German
French

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

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

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

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 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

We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra, V, to its adjacency matrix A. Then, by considering binomial series of Hadamard powers of the idem-potents of the unique complete system of orthogonal idem... see more

In this paper we define combinatorial structures on the conjugacy classes of the maximal subgroups of the symplectic group S(6,2) under the action of two subgroups of S(6,2) isomorphic to U(3,3) or U(4,2). Further, we examine binary and ternary ... 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

We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product K<sub>n</sub> X K<sub>2</sub>. We also prove a lemma that is he... 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.295 pages  |  10  records  |  more records»