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

Circumference of a regular graph

Journal of Graph Theory, 1989
AbstractIt 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   +3 more sources

Decycling regular graphs

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   +2 more sources

Antimagic Labeling of Regular Graphs

Journal of Graph Theory, 2016
Xuding Zhu, Yu-Chang Liang
exaly  

Regular Bipolar Fuzzy Graphs

Neural Computing and Applications, 2012
Muhammad Akram, Wieslaw A Dudek
exaly  

Observability in Connected Strongly Regular Graphs and Distance Regular Graphs

IEEE Transactions on Control of Network Systems, 2014
Alain Kibangou, Christian Commault
exaly  

Fast Generation of Regular Graphs and Construction of Cages

Journal of Graph Theory, 1999
Markus Meringer
exaly  

On the Largest Eigenvalue of Non-Regular Graphs

Journal of Combinatorial Theory Series B, 2007
Bolian Liu
exaly  

On Quasi-Strongly Regular Graphs

Linear and Multilinear Algebra, 2006
Felix Goldberg
exaly  

Strongly Regular Decompositions of the Complete Graph

Journal of Algebraic Combinatorics, 2003
Edwin Robert van Dam
exaly  

Eigenvalues and Edge-Connectivity of Regular Graphs

Linear Algebra and Its Applications, 2010
Sebastian M. Cioaba
exaly  

Home - About - Disclaimer - Privacy