Skip to search formSkip to main contentSkip to account menu

Quantum graph

Known as: Metric graph 
In mathematics and physics, a quantum graph is a linear, network-shaped structure of vertices connected by bonds (or edges) with a differential or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Dirac operatorGraph (discrete mathematics)Graph theoryHilbert space

Broader (1)

Quantum mechanics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Galois quotients of metric graphs and invariant linear systems.
For a map $\varphi : \varGamma \rightarrow \varGamma^{\prime}$ between metric graphs and an isometric action on $\varGamma$ by… 
2018
2018
A G ] 5 O ct 2 01 8 TROPICAL MOMENTS OF TROPICAL JACOBIANS
Each metric graph has canonically associated to it a polarized real torus called its tropical Jacobian. A fundamental real-valued… 
2016
2016
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
Given a metric graph \(G=(V, E, w)\) and a center \(c\in V\), and an integer k, the Star k-Hub Center Problem is to find a depth… 
2016
2016
Approximation algorithms for single allocation k-hub center problem
Given a metric graph G = (V,E,w) and a positive integer k, the Single Allocation k-Hub Center problem is to find a spanning… 
2014
2014
How the permutation of edges of a metric graph affects the number of points moving along the edges
We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr¨ equation… 
2012
2012
Scheduling cloud capacity for Time- Varying customer demand
As utility computing resources become more ubiquitous, service providers increasingly look to the cloud for an in-full or in-part… 
2007
2007
Classically efficient graph isomorphism algorithm using quantum walks
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue… 
2006
2006
Spaces of Kleinian Groups: The pants complex has only one end
, any pair of pants decompositions P and Q, at distance greater than KRfrom a basepoint, can be connected by a path which remains… 
2006
2006
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
Highly Cited
2004
Highly Cited
2004
Central Clustering of Attributed Graphs
Partitioning a data set of attributed graphs into clusters arises in different application areas of structural pattern… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)