Search references for GRAPH PROPERTY. Phrases containing GRAPH PROPERTY
See searches and references containing GRAPH PROPERTY!GRAPH PROPERTY
Property of graphs that depends only on abstract structure
In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations
Graph_property
Mathematical model used by graph-oriented databases
A property graph, labeled property graph, or attributed graph is a data model of various graph-oriented databases, where pairs of entities are associated
Property_graph
Query language for property graphs
GQL (Graph Query Language) is a standardized query language for property graphs first described in ISO/IEC 39075, released in April 2024 by ISO/IEC. The
Graph_Query_Language
Representation of a computer program
property graph (CPG) is a computer program representation that captures syntactic structure, control flow, and data dependencies in a property graph.
Code_property_graph
Topic in computer science
the problem. Typically, property testing algorithms are used to determine whether some combinatorial structure S (such as a graph or a boolean function)
Property_testing
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes
Glossary_of_graph_theory
Subgraph with contracted edges
every graph property preserved by deletions and contractions may be recognized in polynomial time. Other results and conjectures involving graph minors
Graph_minor
Database using graph structures for queries
A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key
Graph_database
Property of functions in topology
functional analysis and topology, closed graph is a property of functions. A real function y=f(x) is closed if the graph is closed, meaning that it contains
Closed_graph_property
Two closely related models for generating random graphs
existence of graphs satisfying various properties, or to provide a rigorous definition of what it means for a property to hold for almost all graphs. There
Erdős–Rényi_model
Graph representing edges of another graph
connected graph G can be recovered completely from its line graph. Many other properties of line graphs follow by translating the properties of the underlying
Line_graph
Unsolved problem on graph query complexity
the worst case, to determine any non-trivial monotone graph property. In this context, a property is monotone if it remains true when edges are added;
Aanderaa–Karp–Rosenberg conjecture
Aanderaa–Karp–Rosenberg_conjecture
Area of discrete mathematics
computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context
Graph_theory
Graph generated by a random process
particular property of the graph is likely to arise. Different random graph models produce different probability distributions on graphs. Most commonly
Random_graph
Theorems connecting continuity to closure of graphs
analysis, the closed graph theorem is a result connecting the continuity of a linear operator to a topological property of their graph. Precisely, the theorem
Closed graph theorem (functional analysis)
Closed_graph_theorem_(functional_analysis)
Infinite graph containing all countable graphs
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with
Rado_graph
Graph representing faces of another graph
embedding of the graph G, so it is a property of plane graphs (graphs that are already embedded in the plane) rather than planar graphs (graphs that may be
Dual_graph
Branch of mathematics
3). Several theorems relate properties of the spectrum to other graph properties. As a simple example, a connected graph with diameter D will have at
Algebraic_graph_theory
Linear operator whose graph is closed
linear operator whose graph is closed (see closed graph property). It is a basic example of an unbounded operator. The closed graph theorem states that
Closed_linear_operator
Matrix representation of a graph
functional graph properties. Kirchhoff's theorem can be used to calculate the number of spanning trees for a given graph. The sparsest cut of a graph can be approximated
Laplacian_matrix
Influence of local substructure of a graph on global properties
In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative
Extremal_graph_theory
Order-zero graph or any edgeless graph
mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes
Null_graph
Graph that can be embedded in the plane
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect
Planar_graph
Type of graph
biconnected graph has no articulation vertices. The property of being 2-connected is equivalent to biconnectivity, except that the complete graph of two vertices
Biconnected_graph
Equivalence of average-case and expected complexity
the graph is through such tests. Richard M. Karp conjectured that every randomized algorithm for every nontrivial monotone graph property (a property that
Yao's_principle
Concept in game theory
of points on the graph converges, its limit point must also belong to the graph. This concept, related to the closed graph property in functional analysis
Graph_continuous_function
Graph property
In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices
Distance-regular_graph
Graph defined from a mathematical group
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract
Cayley_graph
Sparse graph with strong connectivity
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander
Expander_graph
Logical formulation of graph properties
mathematical fields of graph theory and finite model theory, the logic of graphs deals with formal specifications of graph properties using sentences of mathematical
Logic_of_graphs
Class of simple graphs defined from vector spaces
Grassmann graphs are q-analogs of the parameters of Johnson graphs, and Grassmann graphs have several of the same graph properties as Johnson graphs. Jq(n
Grassmann_graph
Graph with oriented edges
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed
Directed_graph
Methodic assignment of colors to elements of a graph
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain
Graph_coloring
Partition of a graph whose components are reachable from all vertices
connected component of a directed graph G is a subgraph that is strongly connected, and is maximal with this property: no set of additional edges or vertices
Strongly_connected_component
Class of artificial neural networks
Graph neural networks (GNNs) are artificial neural networks designed for tasks whose inputs are graphs. Because graphs usually do not have a canonical
Graph_neural_network
On bipartite matching and vertex cover
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem
Kőnig's theorem (graph theory)
Kőnig's_theorem_(graph_theory)
Theorem relating continuity to graphs
mathematics, the closed graph theorem may refer to one of several basic results characterizing continuous functions in terms of their graphs. Each gives conditions
Closed_graph_theorem
Topics referred to by the same term
Open graph may refer to: A confused version of the Closed graph property The Open Graph Protocol This disambiguation page lists articles associated with
Open_graph
Graph property
Colin de Verdière's invariant is a graph parameter μ(G) for any graph G, introduced by Yves Colin de Verdière in 1990. It was motivated by the study of
Colin de Verdière graph invariant
Colin_de_Verdière_graph_invariant
Graphical representation of a computer program or algorithm
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during
Control-flow_graph
Topics referred to by the same term
vertices and edges Graph theory, the study of such graphs and their properties Graph (topology), a topological space resembling a graph in the sense of discrete
Graph
Graph of numbers differing by a square
quadratic residues, and have interesting properties that make them useful in graph theory more generally. Paley graphs are named after Raymond Paley. They
Paley_graph
Vertices connected in pairs by edges
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some
Graph_(discrete_mathematics)
Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De
List_of_graph_theory_topics
Undirected unit-distance graph requiring four colors
In graph theory, a branch of mathematics, the Moser spindle (also called the Mosers' spindle or Moser graph) is an undirected graph, named after mathematicians
Moser_spindle
Property of objects inherited by all their subobjects
context. These properties are particularly considered in topology and graph theory, but also in set theory. In topology, a topological property is said to
Hereditary_property
Generalization of depth-first search trees
monadic second-order logic of graphs allows graph properties involving orientations to be recognized efficiently for graphs of bounded treewidth using Courcelle's
Trémaux_tree
Bijection between the vertex set of two graphs
"graph isomorphism" allows us to distinguish graph properties inherent to the structures of graphs themselves from properties associated with graph representations:
Graph_isomorphism
Directed graph with no directed cycles
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it
Directed_acyclic_graph
Graph of triangles with a shared vertex
the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices and
Friendship_graph
Adjacent subset of an undirected graph
In graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are
Clique_(graph_theory)
Graph divided into two independent sets
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets
Bipartite_graph
Type of knowledge base
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used
Knowledge_graph
Vertex adjacent to all others in a graph
there are an odd number of such graphs on any even number of vertices. This, in turn, can be used to show that the property of having a universal vertex
Universal_vertex
Graph of chess rook moves
In graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's
Rook's_graph
Study of Boolean functions via discrete Fourier analysis
social choice theory, random graphs, and theoretical computer science, especially in hardness of approximation, property testing, and PAC learning. We
Analysis_of_Boolean_functions
Graph theory concept
In graph theory, a planar cover of a finite graph G is a finite covering graph of G that is itself a planar graph. Every graph that can be embedded into
Planar_cover
Two-sided graph with consecutive neighbors
mathematical field of graph theory, a convex bipartite graph is a bipartite graph with specific properties. A bipartite graph (U∪V,E) is said to be convex
Convex_bipartite_graph
Declarative graph query language
Cypher is a declarative graph query language that allows for expressive and efficient data querying in a property graph. Cypher was largely an invention
Cypher_(query_language)
On linear-time algorithms for graph logic
study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided
Courcelle's_theorem
Task of computing complete subgraphs
is a monotone graph property, meaning that, if a clique exists in a given graph, it will exist in any supergraph. Because this property is monotone, there
Clique_problem
Cubic graph with 10 vertices and 15 edges
mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful
Petersen_graph
Theorem in graph theory
Szemerédi's theorem. It also has applications to property testing. Let H be a graph with h vertices. The graph removal lemma states that for any ϵ>0, there
Graph_removal_lemma
Linear algebra aspects of graph theory
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors
Spectral_graph_theory
Graph with a list of distinguished cycles
G. (A "linear class" is a class of circles that satisfies the theta-graph property mentioned above.) A subgraph or edge set whose circles are all in B
Biased_graph
Derived graph of higher chromatic number
In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction
Mycielskian
Least-weight tree connecting graph vertices
graph theory, a minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that
Minimum_spanning_tree
Set of unordered triples from a vertex set
the two-graph. A regular two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph. Two-graphs have been
Two-graph
Graph formed by complementation and disjoint union
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation
Cograph
In mathematics, a graph C*-algebra is a universal C*-algebra constructed from a directed graph. Graph C*-algebras are direct generalizations of the Cuntz
Graph_C*-algebra
Graph in which every two vertices are adjacent
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique
Complete_graph
Directed path algebra
constructed from a directed graph. Leavitt path algebras generalize Leavitt algebras and may be considered as algebraic analogues of graph C*-algebras. Leavitt
Leavitt_path_algebra
Graph whose biconnected components are all cliques
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component
Block_graph
Graph of the vertices and edges of a demihypercube
In graph theory, the halved cube graph or half cube graph of dimension n is the vertex-edge graph of the demihypercube, formed by connecting pairs of vertices
Halved_cube_graph
Undirected graph acted on by a vertex-transitive cyclic group of symmetries
In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes
Circulant_graph
Borel graph theorem is generalization of the closed graph theorem that was proven by L. Schwartz. The Borel graph theorem shows that the closed graph theorem
Borel_graph_theorem
Algorithm for finding shortest paths
an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer
Dijkstra's_algorithm
Number denoting a graph's closeness to a tree
In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest
Treewidth
Conjecture in graph theory
determine the property from the deck of a graph. The following properties of graphs are recognizable: Order of the graph – The order of a graph G, |V(G)|
Reconstruction_conjecture
Graph whose maximal clique hypergraph is a hypertree
Unlike for chordal graphs, the property of being dually chordal is not hereditary, i.e., induced subgraphs of a dually chordal graph are not necessarily
Dually_chordal_graph
Representation of a mathematical function
In mathematics, the graph of a function f is the set of ordered pairs (x,y), where f(x)=y. In the common case where x and f(x) are real numbers, these
Graph_of_a_function
Undirected graph with no non-trivial symmetries
nontrivial symmetries. Formally, an automorphism of a graph is a permutation p of its vertices with the property that any two vertices u and v are adjacent if
Asymmetric_graph
Physical simulation to visualize graphs
Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the
Force-directed_graph_drawing
Graphs formed by a hypercube's edges and vertices
In graph theory, the hypercube graph Qn is the edge graph of the n-dimensional hypercube, that is, it is the graph formed from the vertices and edges
Hypercube_graph
Algorithmically defined graph
In the study of graph algorithms, an implicit graph representation (or more simply implicit graph) is a graph whose vertices or edges are not represented
Implicit_graph
Intersection graph for intervals on the real number line
intersection graph of the intervals. Interval graphs are chordal graphs and perfect graphs. They can be recognized in linear time, and an optimal graph coloring
Interval_graph
Length of shortest path between two nodes of a graph
mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting
Distance_(graph_theory)
American mathematician
areas of spectral graph theory, extremal graph theory and random graphs, in particular in generalizing the Erdős–Rényi model for graphs with general degree
Fan_Chung
monotone graph property; here "nontrivial" means that the function has more than one value, and "monotone" means that adding edges to a graph cannot change
Evasive_Boolean_function
Subdivision of vertices into disjoint sets
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges
Graph_partition
Graph where every connected induced subgraph has a universal vertex
In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals
Trivially_perfect_graph
Second-smallest eigenvalue of a graph Laplacian
points to be assigned to the sign-based partition. Connectivity (graph theory) Graph property Weisstein, Eric W. "Algebraic Connectivity." From MathWorld--A
Algebraic_connectivity
Describing a family of graphs by excluding certain (sub)graphs
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to
Forbidden graph characterization
Forbidden_graph_characterization
Refinement of perfect matching theorems
theorem. This was first studied by Øystein Ore. A related property is surplus. Let G = (V, E) be a graph, and let U be an independent set of vertices, that is
Deficiency_(graph_theory)
Planar graph with 5 nodes and 6 edges
mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar, undirected graph with 5 vertices
Butterfly_graph
Planar bipartite graph with 25 vertices and 31 edges
the resulting graph has no Hamiltonian path. This property was used by Tutte when combining three Walther graphs to produce the Tutte graph, the first known
Walther_graph
Mathematical tree of cycles
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently
Cactus_graph
Family of symmetric graphs which generalize the Petersen graph
odd graphs have high odd girth, meaning that they contain long odd-length cycles but no short ones. However their name comes not from this property, but
Odd_graph
Operation that combines two graphs
In graph theory, the join operation is a graph operation that combines two graphs by connecting every vertex of one graph to every vertex of the other
Join_(graph_theory)
Graph representing intersections between given sets
In graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph can be represented as an
Intersection_graph
travel, tourism, insurance
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
GRAPH PROPERTY
travel, tourism, insurance