AI & ChatGPT searches , social queriess for COMMON GRAPH
Search references for COMMON GRAPH. Phrases containing COMMON GRAPH
See searches and references containing COMMON GRAPH!
Search references for COMMON GRAPH. Phrases containing COMMON GRAPH
See searches and references containing COMMON GRAPH!COMMON GRAPH
Concept in extremal graph theory
In graph theory, an area of mathematics, common graphs belong to a branch of extremal graph theory concerning inequalities in homomorphism densities. Roughly
Common_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)
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 representing edges of another graph
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges
Line_graph
Set of edges without common vertices
mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words
Matching_(graph_theory)
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
Graph in graph theory
In graph theory, the lexicographic product or (graph) composition G ∙ H of graphs G and H is a graph such that the vertex set of G ∙ H is the cartesian
Lexicographic product of graphs
Lexicographic_product_of_graphs
Representation of a mathematical function
In mathematics, the graph of a function f {\displaystyle f} is the set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where f ( x ) = y . {\displaystyle
Graph_of_a_function
Concept in graph theory
adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours. Such a strongly regular graph is denoted by srg(v
Strongly_regular_graph
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
Matrix representation of a graph
Laplacian matrix of a graph corresponding to the signal. The Laplacian matrix is the easiest to define for a simple graph but is more common in applications
Laplacian_matrix
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
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
Data mining for patterns in molecule data
molecules. Since molecules may be represented by molecular graphs, this is strongly related to graph mining and structured data mining. The main problem is
Molecule_mining
Binary operation on graphs
graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H
Graph_product
Cubic graph with 10 vertices and 15 edges
bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the
Petersen_graph
Trail in a graph that visits each edge once
graph has an Euler cycle if and only if every vertex has an even number of incident edges. The term Eulerian graph has two common meanings in graph theory
Eulerian_path
Subdivision of vertices into disjoint sets
see Buluc et al. (2013). Two common examples of graph partitioning are minimum cut and maximum cut problems. Typically, graph partition problems fall under
Graph_partition
Undirected graph named after S. S. Shrikhande
mathematical field of graph theory, the Shrikhande graph is a graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices
Shrikhande_graph
of plotting graphs and solving complex functions. The following table compares general and technical information for a selection of common and uncommon
Comparison of Texas Instruments graphing calculators
Comparison_of_Texas_Instruments_graphing_calculators
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
Graph of triangles with a shared vertex
friendship graph Fn can be constructed by joining n copies of the cycle graph C3 with a common vertex, which becomes a universal vertex for the graph. By construction
Friendship_graph
Graph where each vertex has the same number of neighbors
A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent
Regular_graph
Square matrix used to represent a graph or network
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether
Adjacency_matrix
On existence of a strongly regular graph
whether there exists an undirected graph with 99 vertices, in which each two adjacent vertices have exactly one common neighbor, and in which each two non-adjacent
Conway's_99-graph_problem
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
Form of data structure
A scene graph is a hierarchical data structure commonly used by vector-based graphics editing applications and modern computer games, which cascades the
Scene_graph
Graph whose embedding in a Euclidean space forms a regular tiling
number of complete graphs. A common type of lattice graph (known under different names, such as grid graph or square grid graph) is the graph whose vertices
Lattice_graph
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
File format for graphs
to define a common format for exchanging graph structure data. It uses an XML-based syntax and supports the entire range of possible graph structure constellations
GraphML
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
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
Creating a new graph from an existing graph
computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It
Graph_rewriting
Graph where all long cycles have a chord
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not
Chordal_graph
Matrix that shows the relationship between two classes of objects
a common graph representation in graph theory. It is different to an adjacency matrix, which encodes the relation of vertex-vertex pairs. In graph theory
Incidence_matrix
Number of edges touching a vertex in a graph
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes
Degree_(graph_theory)
Data query language developed by Facebook
or modified. A GraphQL server can process a client query using data from separate sources and present the results in a unified graph. The language is
GraphQL
Abstract data type in computer science
science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within
Graph_(abstract_data_type)
Undirected, connected, and acyclic graph
In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected
Tree_(graph_theory)
Graph database system
functionality of AllegroGraph is made available through Java, Python, Common Lisp and other APIs. The first version of AllegroGraph was made available at
AllegroGraph
Geometric graph with unit edge lengths
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting
Unit_distance_graph
In graph theory, a stepwise irregular graph (or SI graph) is a graph in which the degrees of any two adjacent vertices differ by exactly one. This concept
Stepwise_irregular_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
Writing paper with a grid
Graph paper, coordinate paper, grid paper, or squared paper is writing paper that is printed with fine lines making up a regular grid. It is available
Graph_paper
Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Hofman Graph H(12
List_of_graphs
In polytope theory, the edge graph (also known as vertex-edge graph or just graph) of a polytope is a combinatorial graph whose vertices and edges correspond
Graph_of_a_polytope
Trail in which only the first and last vertices are equal
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is
Cycle_(graph_theory)
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)
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)
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
Sequence of edges which join a sequence of vertices on a given graph
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct
Path_(graph_theory)
Open-source distributed graph database system
NebulaGraph is a free software distributed graph database built for super large-scale graphs with milliseconds of latency. NebulaGraph adopts the Apache
NebulaGraph
Bijection between the vertex set of two graphs
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) {\displaystyle f\colon V(G)\to
Graph_isomorphism
In graph theory and theoretical computer science, a maximum common induced subgraph of two graphs G and H is a graph that is an induced subgraph of both
Maximum common induced subgraph
Maximum_common_induced_subgraph
acyclic graph is formed by adding edges between all pairs of non-adjacent nodes that have a common child, and then making all edges in the graph undirected
Moral_graph
Subgraph with contracted edges
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges
Graph_minor
In graph theory, the Krackhardt kite graph is a simple graph with ten nodes. The graph is named after David Krackhardt, a researcher of social network
Krackhardt_kite_graph
Graph with a median for each three vertices
In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a {\displaystyle a} , b {\displaystyle
Median_graph
Procedures for constructing new graphs in graph theory
graph from an initial one by a complex change, such as: transpose graph; complement graph; line graph; graph minor; graph rewriting; power of graph;
Graph_operations
Graph whose vertices correspond to combinations of a set of n elements
In graph theory, the Kneser graph K(n, k) (alternatively KGn,k) is the graph whose vertices correspond to the k-element subsets of a set of n elements
Kneser_graph
2D graphic with logarithmic scales on both axes
In science and engineering, a log–log graph or log–log plot is a two-dimensional graph of numerical data that uses logarithmic scales on both the horizontal
Log–log_plot
Type of graph
In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any one vertex were to be removed, the graph will remain
Biconnected_graph
Graph coloring where graph elements are assigned sets of colors
in a branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In a traditional graph coloring, each
Fractional_coloring
Longest distance between tree vertices
In graph theory, the triameter is a metric invariant that generalizes the concept of a graph's diameter. It is defined as the maximum sum of pairwise
Triameter_(graph_theory)
Tree node with two other nodes as descendants
In graph theory and computer science, the lowest common ancestor (LCA) (also called least common ancestor) of two nodes v and w in a tree or directed
Lowest_common_ancestor
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
linear program. Two graphs are also fractionally isomorphic if they have a common coarsest equitable partition. A partition of a graph is a collection of
Fractional_graph_isomorphism
Computer science algorithm
computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals
Graph_traversal
Graph with sign-labeled edges
In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign. A signed graph is balanced if
Signed_graph
Graphical representation of energy flows in physical systems
to systems biology. Because the concept of energy is common to all physical domains, the bond graph provides a unified description of all of these energy
Bond_graph
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
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
In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and
Topological_graph
Measure of the structural complexity of a software program
Cyclomatic complexity is computed using the control-flow graph of the program. The nodes of the graph correspond to indivisible groups of commands of a program
Cyclomatic_complexity
Graph with nodes connected linearly
In the mathematical field of graph theory, a path graph (or linear graph) is a graph whose vertices can be listed in the order v1, v2, ..., vn such that
Path_graph
Framework for a family of logic languages
repository of Common Logic Ontologies Hets supports Common Logic cltools is a PROLOG library with partial support for Common Logic Conceptual graph Knowledge
Common_Logic
Graph where every edge is in one triangle
In graph theory, a locally linear graph is an undirected graph in which every edge belongs to exactly one triangle. Equivalently, for each vertex of the
Locally_linear_graph
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
mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph srg(100
Higman–Sims_graph
Intersection graph representing regions on the Euclidean plane
Euclidean plane. The map graphs include the planar graphs, but are more general. Any number of regions can meet at a common corner (as in the Four Corners
Map_graph
Graph with tight clique-coloring relation
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every
Perfect_graph
Intersection graph of convex polygons whose vertices lie on a common circle
graph theory, a polygon-circle graph is an intersection graph of a set of convex polygons all of whose vertices lie on a common circle. These graphs have
Polygon-circle_graph
Index of articles associated with the same name
In graph theory and theoretical computer science, a maximum common subgraph may mean either: Maximum common induced subgraph, a graph that is an induced
Maximum_common_subgraph
Open-source network monitoring software
and graphing application. It functions as a front end for RRDtool, collecting time-series data from network devices and presenting the data as graphs through
Cacti_(software)
algorithm Tarjan's off-line lowest common ancestors algorithm Tarjan's algorithm for finding bridges in an undirected graph Tarjan's algorithm for finding
Tarjan's_algorithm
Graph which remains connected when k or fewer nodes removed
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer
Vertex_connectivity
constraint graphs and hypergraphs are used to represent relations among constraints in a constraint satisfaction problem. A constraint graph is a special
Constraint_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)
Abstract syntax representing expressions as graphs
semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose
Abstract_semantic_graph
One of two types of graph
common edge. A book of this type is a split graph. This graph has also been called a K e ( 2 , p ) {\displaystyle K_{e}(2,p)} or a thagomizer graph (after
Book_(graph_theory)
Graphical representation of data
A chart (sometimes known as a graph) is a graphical representation for data and information visualization, in which "the data is represented by symbols
Chart
Mathematical graph of a Sudoku
7-regular. For the most common form of Sudoku, on a 9 × 9 {\displaystyle 9\times 9} board, the Sudoku graph is a 20-regular graph with 81 vertices and 810
Sudoku_graph
Undirected graph with no non-trivial symmetries
In graph theory, a branch of mathematics, an undirected graph is called an asymmetric graph if it has no nontrivial symmetries. Formally, an automorphism
Asymmetric_graph
Data structure representing a finite set of strings
form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or
Deterministic acyclic finite state automaton
Deterministic_acyclic_finite_state_automaton
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
Archimedean solid with 62 faces
pentagrammic prisms. In the mathematical field of graph theory, a rhombicosidodecahedral graph is the graph of vertices and edges of the rhombicosidodecahedron
Rhombicosidodecahedron
Form taken by the network of interconnections of a circuit
branches in common with an arbitrary number of other meshes will not, in general, result in a realisable graph. This is because the graph of the transform
Circuit_topology_(electrical)
Structure on sequences of digits 1 and 2
calls a graph with these properties a Y-graph; Stanley (1988) calls a graph with a weaker version of these properties (in which the numbers of common predecessors
Young–Fibonacci_lattice
Network that allows computers to share resources and communicate with each other
logical interconnections of network hosts. Common topologies are: Bus network: all nodes are connected to a common medium along this medium. This was the
Computer_network
Class of undirected graphs defined from systems of sets
mathematics, Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle
Johnson_graph
COMMON GRAPH
COMMON GRAPH
Male
English
English masculine variant spelling of Scottish Cameron, CAMRON means "crooked nose."
Male
English
 Anglicized form of Hebrew Rimmown, RIMMON means "pomegranate." In the bible, this is the name of several places, the name of a Benjamite of Beeroth.Â
Male
Irish
Irish name COMYN means "shrewd."
Male
English
 Anglicized form of Hebrew Ammown, AMMON means "kindred, tribal." In the bible, this is the name of a son of Lot by his younger daughter. Compare with another form of Ammon.
Surname or Lastname
English (common in Bristol)
English (common in Bristol) : variant of Gingold, of which the origin is unexplained.Respelling of German Gingel, a common Bavarian surname, derived from a short form of the Germanic personal name Gangulf, composed of the elements gangan ‘to walk or go’ + (w)ulf ‘wolf’.
Surname or Lastname
English
English : habitational name from any of numerous places named from Old English cotum (dative plural of cot) ‘at the cottages or huts’ (or sometimes possibly from a Middle English plural, coten). Examples include Coton (Cambridgeshire, Northamptonshire, Staffordshire), Cottam (East Yorkshire, Lancashire, Nottinghamshire), and Cotham (Nottinghamshire).French : from a diminutive of Old French cot(t)e ‘coat (of mail)’ (see Cott).John Cotton (1584–1652) was a noted Puritan preacher, who landed at Boston, MA, from London in 1633 and became leader of the Congregationalists in America.
Surname or Lastname
Swedish (common in Finland)
Swedish (common in Finland) : ornamental name formed with the common surname suffix -in and an unexplained first element.German : unexplained.English : unexplained.Spanish (FarÃn) : unexplained.
Surname or Lastname
English and Scottish
English and Scottish : habitational name from any of various places called Colton in England, perhaps also Colton House in Scotland. Examples in Norfolk, Staffordshire, and North Yorkshire are from the Old English personal name Cola (or the cognate Old Norse Koli; see Cole 2) + Old English tūn ‘enclosure’, ‘settlement’. The place so named in Somerset has as its first element the Old English personal name Cūla (of uncertain origin). The one in Cumbria has a river name apparently derived from a Celtic word meaning ‘hazel’.
Boy/Male
Australian, Biblical, Latin, Shakespearean
Common
Surname or Lastname
English (formerly common in Kent)
English (formerly common in Kent) : unexplained. This name seems to have died out in Britain.
Surname or Lastname
English
English : habitational name from any of the numerous places throughout England (but especially in the south) named Compton, from Old English cumb ‘short, straight valley’ + tūn ‘enclosure’, ‘settlement’.
Surname or Lastname
English (common in Lancashire)
English (common in Lancashire) : habitational name from Sharples Hall near Bolton, probably so called from Old English scearp ‘sharp’, i.e. ‘steep’ + lǣs ‘pasture’.
Surname or Lastname
English (also common in South Wales)
English (also common in South Wales) : patronymic from the personal name Edmund (see Edmond).
Surname or Lastname
Scottish and northern Irish
Scottish and northern Irish : variant of Curzon.English (of Norman origin) : nickname from Old French corson, a diminutive of curt ‘short’ (see Court).
Male
Romanian
Romanian form of Greek Kosmos, COSMIN means "order, beauty."
Male
Irish
Contracted form of Irish Gaelic Comhghán, COMGAN means "born together."
Male
Greek
(Ἄμμων) Greek form of Egyptian Yamanu, AMMON means "the hidden one." In mythology, Yamanu is the name of a god of wind and air. Compare with another form of Ammon.
Biblical
common
Male
English
English form of Irish Colmán, COLMAN means "dove."
Surname or Lastname
French, English, and Spanish (Cordón)
French, English, and Spanish (Cordón) : from Old French cordon ‘cord’, ‘ribbon’, a diminutive of corde ‘string’, ‘cord’; Spanish cordón, hence a metonymic occupational name for a maker or seller of cord or ribbon.English : metonymic occupational name for a worker in fine Spanish kid leather, from Old French cordoan (so named with being originally produced at Córdoba).
COMMON GRAPH
COMMON GRAPH
Girl/Female
Hindu, Indian, Kannada, Malayalam, Marathi, Oriya, Tamil, Telugu
Gold; Golden; True Beauty; Lord of Lady; Daughter of Sun
Boy/Male
American, Australian, British, Chinese, Christian, Dutch, English, French, German
From the Fortified Town; Form of Burton; Place Name; Bright Settlement; Fortified Enclosure; Shining Pledge
Girl/Female
Scottish
Sometimes used in Scotland as a translation of the Gaelic 'Aonghus'.
Boy/Male
Hindu, Indian, Kannada, Marathi, Sanskrit, Telugu
Son of Kunti
Boy/Male
Indian, Sikh
Strong
Biblical
wares; a price
Girl/Female
Hindu
A name of river
Surname or Lastname
English
English : variant of Newman.Americanized form of various European cognates with the same meaning, for example Neumann. (For other forms, see Hanks and Hodges 1988.)
Boy/Male
Hindu
Boy/Male
Hindu
House, Mansion, Don of rulers
COMMON GRAPH
COMMON GRAPH
COMMON GRAPH
COMMON GRAPH
COMMON GRAPH
n.
One of the common people; one having no rank of nobility.
n.
A member of the House of Commons.
v. t.
To give notice to, or command to appear, as in court; to cite by authority; as, to summon witnesses.
n. pl.
A common; public pasture ground.
v.
Belonging or relating equally, or similarly, to more than one; as, you and I have a common interest in the property.
a.
Not common; unusual; infrequent; rare; hence, remarkable; strange; as, an uncommon season; an uncommon degree of cold or heat; uncommon courage.
n. pl.
Provisions; food; fare, -- as that provided at a common table in colleges and universities.
v. i.
To board together; to eat at a table in common.
n.
A common; a piece of land in which two or more persons have a common right.
n.
The right of taking a profit in the land of another, in common either with the owner or with other persons; -- so called from the community of interest which arises between the claimant of the right and the owner of the soil, or between the claimants and other commoners entitled to the same right.
a.
Alt. of Compone
n.
The commonalty; the common people.
n. pl.
The mass of the people, as distinguished from the titled classes or nobility; the commonalty; the common people.
adv.
In common; familiarly.
a.
See Compony.
n. pl.
A club or association for boarding at a common table, as in a college, the members sharing the expenses equally; as, to board in commons.
v.
Belonging to or shared by, affecting or serving, all the members of a class, considered together; general; public; as, properties common to all plants; the common schools; the Book of Common Prayer.
n.
One who has a joint right in common ground.
v. i.
To have a joint right with others in common ground.