Results 311 to 320 of about 4,129,862 (348)
Some of the next articles are maybe not open access.

Regular factors of regular graphs

Journal of Graph Theory, 1985
AbstractGiven r ⩾ 3 and 1 ⩽ λ ⩽ r, we determine all values of k for which every r‐regular graph with edge‐connectivity λ has a k‐factor.
Béla Bollobás   +2 more
openaire   +2 more sources

On the E-Optimality of Regular Graph Designs

Journal of the Royal Statistical Society Series B: Methodological, 1980
Mike Jacroux
exaly   +2 more sources

There is no (95, 40, 12, 20) strongly regular graph

Journal of combinatorial designs (Print), 2016
We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2).
Jernej Azarija, Tilen Marc
semanticscholar   +1 more source

Skeleton-Based Action Recognition With Shift Graph Convolutional Network

Computer Vision and Pattern Recognition, 2020
Action recognition with skeleton data is attracting more attention in computer vision. Recently, graph convolutional networks (GCNs), which model the human body skeletons as spatiotemporal graphs, have obtained remarkable performance.
Ke Cheng   +5 more
semanticscholar   +1 more source

Equimatchable Regular Graphs

Journal of Graph Theory, 2017
AbstractA graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3‐regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r‐regular graph, then .
Saieed Akbari   +3 more
openaire   +2 more sources

Regularity of vague graphs

Journal of Intelligent & Fuzzy Systems, 2016
A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, some properties of an edge regular vague graph are given.
Rajab Ali Borzooei   +3 more
openaire   +1 more source

Regular Graphs, Eigenvalues and Regular Factors

Journal of Graph Theory, 2011
AbstractIn this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of k such that every r‐regular graph with the third largest eigenvalue at most has a k‐factor.
openaire   +3 more sources

Kernels and Regularization on Graphs

2003
We introduce a family of kernels on graphs based on the notion of regularization operators. This generalizes in a natural way the notion of regularization and Greens functions, as commonly used for real valued functions, to graphs. It turns out that diffusion kernels can be found as a special case of our reasoning.
Alexander J. Smola, Risi Kondor
openaire   +1 more source

Regularity of Congruential Graphs

2000
The aim of this article is to make a link between the congruential systems investigated by Conway and the infinite graphs theory. We compare the graphs of congruential systems with a well known family of infinite graphs: the regular graphs of finite degree considered by Muller and Shupp, and by Courcelle.
openaire   +1 more source

Domination in regular graphs

Ars Comb., 1996
A two-valued function \(f\) defined on the vertices of a graph \(G=(V,E)\), \(f:V\rightarrow \{-1,1\}\), is a signed dominating function if the sum of its function values over any closed neighborhood is at least one. It is a majority dominating function if this holds true for at least half of the neighborhoods.
openaire   +2 more sources

Home - About - Disclaimer - Privacy