Results 281 to 290 of about 96,525 (309)
Some of the next articles are maybe not open access.
Regular Graphs, Eigenvalues and Regular Factors
Journal of Graph Theory, 2011AbstractIn 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 +2 more sources
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
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
Kernels and Regularization on Graphs
2003We 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
2000The 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
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 +1 more source
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 +1 more source
Circumference of a regular graph
Journal of Graph Theory, 1989AbstractIt is proved that a 4‐connected, δ‐regular graph G either is Hamiltonian, or has at least 3δ + 1 vertices and contains a cycle of length at least min{4δ ‐ 4, 1/2 (|G| + 3δ ‐ 2)}. Examples supplied by B. Jackson and H.A. Jung show that min{4δ ‐ 4, 1/2(|G| + 3δ ‐ 2)} cannot be replaced by 4δ + 1.
openaire +2 more sources
Decycling regular graphs [PDF]
Australas. J Comb., 2005 If \(G\) is a graph and \(S\) is a set of vertices of \(G\) such that \(G-S\) is acyclic, then \(S\) is called decycling set of \(G\). The cardinality of the smallest decycling set of \(G\) is called the decycling number of \(G\) and it is denoted by \(\phi(G)\). It is shown, that if \({\mathbf d}\) is a fixed graphic degree sequence and \({\mathcal R}(
openaire +1 more source