ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Research
Social Sciences
Architecture and Urbanism
Computing
Biology
Mathematics
Pure sciences
Computing
all records (75)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
Brazil
USA
Ukraine
Canada
Cuba
Austria
South Africa
Italy
Spain
all records (82)

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

Filter  
 
28.677  Articles
1 of 2.869 pages  |  10  records  |  more records»
Suzuki (2004)  classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third author (2004) under the assumption of the commuta... see more

Suzuki (2004)  classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third author (2004) under the assumption of the commuta... see more

A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed gr... see more

It is proved that if I and J are weakly stable ideals in a polynomial ring R = k[x_1, . . ., x_n], with k a field, then the regularity of Tor^R_i (R/I, R/J) has the expected upper bound. We also give a bound for the regularity of Ext^i_R (R/I, R) for I a ... see more

Lung is one in control in the circulatory system of air (oxygen) in the human body, so the detection of disorders of the human respiratory urgently needed to detect any disturbance in the lungs used X-ray beam, from the results of x-ray image of the thor... 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

It is proved that if I and J are weakly stable ideals in a polynomial ring R = k[x_1, . . ., x_n], with k a field, then the regularity of Tor^R_i (R/I, R/J) has the expected upper bound. We also give a bound for the regularity of Ext^i_R (R/I, R) for I a ... see more

We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) 3-connected maps. This allows ... see more

1 of 2.869 pages  |  10  records  |  more records»