Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Glossary of graph theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==K== {{glossary}} {{term|K|''K''}} {{defn|For the notation for complete graphs, complete bipartite graphs, and complete multipartite graphs, see {{gli|complete}}.}} {{term|kappa|''κ''}} {{defn|{{math|''κ''(''G'')}} (using the Greek letter kappa) can refer to the [[vertex connectivity]] of {{mvar|G}} or to the {{gli|clique|clique number}} of {{mvar|G}}.}} {{term|kernel}} {{defn|A kernel of a directed graph is a set of vertices which is both {{gli|stable}} and {{gli|absorbing}}.}} {{term|knot}} {{defn|An inescapable section of a {{gli|directed graph}}. See [[knot (mathematics)]] and [[knot theory]].}} {{glossary end}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)