Graph Theory - Connectivity of r-regular graphs

Gh0stZA
Messages
25
Reaction score
0
Hello everyone.

Find the minimum positive integer r for which there exists an r-regular graph G such that λ(G) ≥ κ(G) + 2

All help appreciated.
 
Physics news on Phys.org
Sorry for the bump, any ideas on this?
 

Thread 'Deductive proof in logic formal systems'

I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
View full post »

Similar threads

MHB Are Events in Random Graphs from G(n, 1/2) Independent?
Replies
1
Views
2K
MHB Minimum Degree of a Random Graph (Probabilistic Method)
Replies
1
Views
2K
MHB Probability of Having a Totally Dominating Set (Probabilistic Methods)
Replies
1
Views
2K
MHB Understanding Two Graph Theory Problems
Replies
2
Views
2K
MHB How many edges does the graph have?
Replies
4
Views
2K
MHB Graph: showing that diameter is greater than average pairwise distance
Replies
4
Views
3K
MHB A Subset of a Graph with No Perfect Matching
Replies
1
Views
2K
A Concrete examples of randomness in math vs. probability theory
Replies
11
Views
3K
MHB Is HSC NP-Complete in Graph Theory?
Replies
1
Views
2K
MHB Graph Grammer Function For Two Exotic Graphs Question please.
Replies
4
Views
2K

Hot Threads

Recent Insights

Back
Top