Graph of a relation

Redirect to:

Graph of a function#graph of a relation

This page is a redirect. The following categories are used to track and monitor this redirect:

To an embedded anchor: This is a redirect from a topic that does not have its own page to an embedded anchor on the redirect's target page.
- An {{anchor|(anchor name)}} or {{visible anchor}} template, a HTML element with id="(anchor name)", or an |id=(anchor name) parameter might be installed at the beginning of a paragraph, in or near a section header or within a table. The anchor might also be an old section header that has been edited and is anchored within or near the new header to prevent broken internal and external links.
- Even though section headers of the general form ==(Header name)== are themselves a type of anchor, use {{R to section}} instead.

With possibilities: This is a redirect from a title that potentially could be expanded into a new article or other type of associated page such as a new template. The topic described by this title may be more detailed than is currently provided on the target page or in a section of that page.
- When the target page becomes too large, or for any reason a new page would be an improvement, this redirect may be replaced with an article, template or other project page that is carved out of the target page. See also {{R to section}} and use together with this rcat when appropriate.
- If the topic of the redirect is not susceptible to expansion, then use other rcats such as {{R to section}} or {{R to list entry}} when appropriate.
- Since a new page may be created, links to this redirect should not be replaced with a direct link to the target page. To make redirects to this page, use {{R avoided double redirect}}.
- {{R printworthy}} should be used together with this template when applied to a redirect in mainspace.
- When used on a template redirect, it will automatically populate Category:Template redirects with possibilities.

When appropriate, protection levels are automatically sensed, described and categorized.

Information related to Graph of a relation

Graph isomorphism, Multipartite graph, Tietze's graph, Cubic graph, Property graph, Graph automorphism, Social graph, Graph drawing, Möbius–Kantor graph, Bipartite graph, Graph factorization, Circular-arc graph, Homeomorphism (graph theory), Grötzsch graph, Graph of a function, Rado graph, Cycle (graph theory), Graph (abstract data type), Trivially perfect graph, Distance (graph theory), Split graph, Biconnected graph, Clebsch graph, Quartic graph, Graph canonization, Graph center, Sparksee (graph database), Erdős–Diophantine graph, Complete graph, Symmetric graph, Kneser graph, Knight's graph, DOT (graph description language), Indifference graph, Diameter (graph theory), Spectral graph theory, Directed acyclic graph, Closed graph property, Holt graph, Graph Query Language, Orientation (graph theory), Series–parallel graph, Glossary of graph theory, Thickness (graph theory), Graph power, Conceptual graph, Hall–Janko graph, Bivariegated graph, Shift graph, Ellingham–Horton graph

Graph, Line graph, Lattice graph, Graph (discrete mathematics), Planar graph, Graph theory, Graph database, Graph rewriting, Null graph, Directed graph, Complement graph, Chordal graph, Graph coloring, Matchstick graph, Dual graph, Butterfly graph, Pancyclic graph, Graph operations, Petersen graph, Graph embedding, Graph neural network, Implicit graph, Cycle graph, Periodic graph (graph theory), Graph partition, Knowledge graph, Dense graph, Graph labeling, Graph property, Graph minor, Connectivity (graph theory), Misleading graph, Regular graph, Graph homomorphism, Outerplanar graph, Existential graph, Graph traversal, Walk-regular graph, Turán graph, List of graphs, Random graph, Graph isomorphism, Multipartite graph, Tietze's graph, Cubic graph, Property graph, Graph automorphism, Social graph, Graph drawing, Möbius–Kantor graph, Bipartite graph, Graph factorization, Circular-arc graph, Homeomorphism (graph theory), Grötzsch graph, Graph of a function, Rado graph, Cycle (graph theory), Graph (abstract data type), Trivially perfect graph, Distance (graph theory), Split graph, Biconnected graph, Clebsch graph, Quartic graph, Graph canonization, Graph center, Sparksee (graph database), Erdős–Diophantine graph, Complete graph, Symmetric graph, Kneser graph, Knight's graph, DOT (graph description language), Indifference graph, Diameter (graph theory), Spectral graph theory, Directed acyclic graph, Closed graph property, Holt graph, Graph Query Language, Orientation (graph theory), Series–parallel graph, Glossary of graph theory, Thickness (graph theory), Graph power, Conceptual graph, Hall–Janko graph, Bivariegated graph, Shift graph, Ellingham–Horton graph, Graph matching, Molecular graph, Geometric graph theory, Distance-transitive graph, Distance-regular graph, Kőnig's theorem (graph theory), Interest graph, Critical graph, Signed graph, Star (graph theory), Transpose graph, Degree (graph theory), Ladder graph, Rooted graph, Mixed graph, Cayley graph, Signal-flow graph, 26-fullerene graph, Biregular graph, Path (graph theory), Cop-win graph, Vertex (graph theory), Nearest neighbor graph, Constraint graph, Dürer graph, Comparability graph, Neighbourhood (graph theory), Klein graphs, Rook's graph, Prism graph, K-vertex-connected graph, McLaughlin graph, Brouwer–Haemers graph, Girth (graph theory), Perfect graph, Component (graph theory), Hoffman–Singleton graph, Scene graph, Relative neighborhood graph, Volpert graph, Wait-for graph, Tree (graph theory), Distance-hereditary graph, Expander graph, Diamond graph, Extremal graph theory, Process graph, Bridge (graph theory), Graph bandwidth, Friendship graph, The Graph, Schläfli graph, Graph isomorphism problem, Strong perfect graph theorem, Shannon capacity of a graph, Andrásfai graph, Graph paper, Toroidal graph, Attributed graph grammar, M22 graph

Graph of a relation

Information related to Graph of a relation

Portal di Ensiklopedia Dunia