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
Graph (discrete mathematics)
(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!
== Graph operations == {{main|Graph operations}} There are several operations that produce new graphs from initial ones, which might be classified into the following categories: * ''unary operations'', which create a new graph from an initial one, such as: ** [[edge contraction]], ** [[line graph]], ** [[dual graph]], ** [[complement graph]], ** [[graph rewriting]]; * ''binary operations'', which create a new graph from two initial ones, such as: ** [[disjoint union of graphs]], ** [[cartesian product of graphs]], ** [[tensor product of graphs]], ** [[strong product of graphs]], ** [[lexicographic product of graphs]], ** [[series–parallel graph]]s.
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)