Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,281,308 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.
2015
2015
Modeling of Integration Processes in the Business Structures
V. Ragulina
,
V. Stroiteleva
,
I. Miller
2015
Corpus ID: 64729354
The article suggests the methodological approaches to the problems of corporate actions harmonization and optimization, as well…
Expand
2013
2013
ON INTEGER ADDITIVE SET-INDEXERS OF GRAPHS
N. Sudev
,
K. A. Germina
2013
Corpus ID: 116919830
A set-indexer of a graph G is an injective set-valued function f : V (G)! 2 X such that the function f : E(G)! 2 X f;g dened by f…
Expand
2006
2006
Visualization Of Construction Progress Monitoring
SangHyun Lee and Feniosky Peña-Mora
2006
Corpus ID: 54039465
This paper proposes several visualization techniques for progress monitoring. When there is a discrepancy between as-planned and…
Expand
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
2004
Highly Cited
2004
Slightly ∞-Continuous Functions
E. Ekici
,
M. Caldas
2004
Corpus ID: 73546524
The purpose of this paper is to give a new weak form of some types of continuity generalizing strongly fi-irresoluteness, fi…
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
1999
1999
Constructing the Concept Image of a Tangent
D. Tall
1999
Corpus ID: 117804036
When a learner meets a new mathematical concept, it may be invested with implicit properties arising from the context, producing…
Expand
1989
1989
Lexical access to large vocabularies for speech recognition
L. Fissore
,
P. Laface
,
G. Micca
,
R. Pieraccini
IEEE Transactions on Acoustics Speech and Signal…
1989
Corpus ID: 16387636
A large-vocabulary isolated-word recognition system based on the hypothesize-and-test paradigm is described. Word preselection is…
Expand
Highly Cited
1981
Highly Cited
1981
Node-fault diagnosis and a design of testability
Z. Huang
,
C. Lin
,
R. Liu
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