Triameter (graph Theory)
   HOME



picture info

Triameter (graph Theory)
In Graph theory, graph theory, the triameter is a metric Graph property, invariant that generalizes the concept of a Diameter (graph theory), graph's diameter. It is defined as the maximum sum of pairwise Distance (graph theory), distances between any three Vertex (graph theory), vertices in a Connectivity (graph theory), connected graph G and is denoted by \mathop(G) = \max\, where V is the vertex set of G and d(u,v) is the length of the shortest Path (graph theory), path between Vertex (graph theory), vertices u and v. It extends the idea of the Diameter (graph theory), diameter, which captures the longest Path (graph theory), path between any two of its Vertex (graph theory), vertices. A triametral triple is a Set (mathematics), set of three Vertex (graph theory), vertices achieving \mathop(G). History The parameter of triameter is related to the channel Assignment problem, assignment problem—the problem of assigning Frequency, frequencies to the Transmitter, transmitter ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Graph Theory
In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') which are connected by ''Glossary of graph theory terms#edge, edges'' (also called ''arcs'', ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a Set (mathematics), set of vertices (also called nodes or points); * ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE