Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,998,345 papers from all fields of science
Search
Sign In
Create Free Account
Graph (discrete mathematics)
Known as:
Simple graph
, Finite undirected graph
, Undirected
Expand
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adjacency list
B-coloring
Bipartite realization problem
Bridge (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Advances in Web-Based Learning – ICWL 2004
Wenyin Liu
,
Yuanchun Shi
,
Qing Li
Lecture Notes in Computer Science
2004
Corpus ID: 3859915
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm…
Expand
Highly Cited
2003
Highly Cited
2003
Consensus Protocols for Undirected Networks of Dynamic Agents with Communication Time-Delays
R. Olfati-Saber
,
R. Murray
2003
Corpus ID: 700301
In this paper, we introduce linear and nonlinear consensus protocols for networks of dynamic agents that allow the agents to…
Expand
Highly Cited
1992
Highly Cited
1992
An interactive layout heuristic based on hexagonal adjacency graphs
M. Goetschalckx
1992
Corpus ID: 62680199
Highly Cited
1983
Highly Cited
1983
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
Dhruva Nath
,
S. Maheshwari
,
P. Bhatt
IEEE transactions on computers
1983
Corpus ID: 22667234
In this paper we describe two interconnection networks for parallel processing, namely the orthogonal trees network and the…
Expand
Highly Cited
1983
Highly Cited
1983
Minimum-Via Topological Routing
Chi-Ping Hsu
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1983
Corpus ID: 17126741
A new approach to the two-dimensional routing utilizing two layers is proposed. It consists of two major steps, topological…
Expand
Highly Cited
1981
Highly Cited
1981
Node-fault diagnosis and a design of testability
Huang Zheng
,
Raymond Liu
,
Chi-Cheng Steve Lin
20th IEEE Conference on Decision and Control…
1981
Corpus ID: 21169002
A concept of k-node-fault testability is introduced. A sufficient and almost necessary condition for testability as well as the…
Expand
Highly Cited
1980
Highly Cited
1980
Generalization of the Graph Center Concept, and Derived Topological Centric Indexes
D. Bonchev
,
A. Balaban
,
O. Mekenyan
Journal of chemical information and computer…
1980
Corpus ID: 3277479
6 z The concept of topological center is generalized for any connected acyclic or cyclic graph on the basis of the topological…
Expand
Review
1976
Review
1976
Analytical precision of one-sixth order semiquantitative spectrographic analysis
By J. M. Motooka
,
D. Grimes
1976
Corpus ID: 129816700
Over 2,700 separate analyses were made on 22 different geologic samples selected to cover wide concentration ranges for the 30…
Expand
Highly Cited
1976
Highly Cited
1976
Convex Location Problems on Tree Networks
Perino M. Dearing
,
R. L. Francis
,
T. Lowe
Operational Research
1976
Corpus ID: 37249181
This paper studies problems of finding optimal facility locations on an imbedding of a finite, undirected network having positive…
Expand
Highly Cited
1971
Highly Cited
1971
Pair Grammars, Graph Languages and String-to-Graph Translations
T. W. Pratt
Journal of computer and system sciences (Print)
1971
Corpus ID: 205894879
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