Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,710,943 papers from all fields of science
Search
Sign In
Create Free Account
Quotient graph
In graph theory, a quotient graph Q of a graph G is a graph whose vertices are blocks of a partition of the vertices of G and where block B is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Connected component (graph theory)
Covering graph
Directed acyclic graph
Edge contraction
Expand
Broader (1)
Graph operations
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Network Specializations, Symmetries, and Spectral Properties
Dallas Smith
2018
Corpus ID: 126209724
Network Specializations, Symmetries, and Spectral Properties Dallas C. Smith Department of Mathematics, BYU Doctor of Philosophy…
Expand
2016
2016
Speeding-up node influence computation for huge social networks
M. Kimura
,
Kazumi Saito
,
K. Ohara
,
H. Motoda
International Journal of Data Science and…
2016
Corpus ID: 256470956
We address the problem of efficiently estimating the influence degree for all the nodes simultaneously in the network under the…
Expand
2015
2015
Symmetric graphs of order 4p of valency prime
Xiuyun Wang
2015
Corpus ID: 36831918
A graph is symmetric or arc-transitive if its automorphism group acts transitively on vertices, edges and arcs. Let p, q be odd…
Expand
2010
2010
Vertex-transitive expansions of (1, 3)-trees
Marko Lovrecic Sarazin
,
D. Marušič
Discrete Mathematics
2010
Corpus ID: 5835636
2007
2007
Almost covers of 2-arc transitive graphs
Sanming Zhou
Comb.
2007
Corpus ID: 43176632
Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition ℬ with block size v. Let Γ ℬ be the…
Expand
2006
2006
Compositional SCC Analysis for Language Emptiness
Chao Wang
,
Roderick Bloem
,
G. Hachtel
,
Kavita Ravi
,
F. Somenzi
Formal Methods Syst. Des.
2006
Corpus ID: 17451344
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs…
Expand
2006
2006
Using Term Lists and Inverted Files to Improve Search Speed for Metabolic Pathway Databases
Greeshma Neglur
,
R. Grossman
,
N. Maltsev
,
Clement T. Yu
Data Integration in the Life Sciences
2006
Corpus ID: 14010719
This paper describes a technique for efficiently searching metabolic pathways similar to a given query pathway, from a pathway…
Expand
1999
1999
NLC2-Decomposition in Polynomial Time
Öjvind Johansson
International Journal of Foundations of Computer…
1999
Corpus ID: 1884536
NLCk is a family of algebras on vertex-labeled graphs introduced by Wanke. An NLC-decomposition of a graph is a derivation of…
Expand
1994
1994
Connectivity and Spectrum in a Graph with a Regular Automorphism Group of odd Order
J. A. Sjogren
International journal of algebra and computation
1994
Corpus ID: 40185736
Let a finite group G of odd order n act regularly on a connected (multi-)graph Γ. That is, no group element other than the…
Expand
1977
1977
Antipodal Embeddings of Graphs
M. Farzan
,
D. A. Waller
1977
Corpus ID: 9781507
An antipodal graph D of diameter d has the property that each vertex v has a unique (antipodal) vertex v at distance d from v in…
Expand
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)
ACCEPT & CONTINUE