Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,061,351 papers from all fields of science
Search
Sign In
Create Free Account
Graph property
Known as:
Graph invariant
, Graph properties
In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
46 relations
Aanderaa–Karp–Rosenberg conjecture
Adjacency matrix
Algebraic connectivity
Algebraic graph theory
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Generation of Implied Constraints for Automaton-Induced Decompositions
María Andreína Francisco Rodríguez
,
P. Flener
,
J. Pearson
IEEE International Conference on Tools with…
2013
Corpus ID: 7332740
Automata, possibly with counters, allow many constraints to be expressed in a simple and high-level way. An automaton induces a…
Expand
2012
2012
Bounds and Computation of Irregularity of a Graph
H. Abdo
,
Nathann Cohen
,
D. Dimitrov
arXiv.org
2012
Corpus ID: 14169920
Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v…
Expand
2010
2010
The Complexity of Partition Functions on Hermitian Matrices
M. Thurley
arXiv.org
2010
Corpus ID: 16151042
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial…
Expand
2009
2009
Detecting Threats in Star Graphs
N. Imani
,
H. Sarbazi-Azad
,
Albert Y. Zomaya
,
Paria Moinzadeh
IEEE Transactions on Parallel and Distributed…
2009
Corpus ID: 15029982
In this paper, we consider the problem of searching a network for intruders. We propose a strategy for capturing the intruder in…
Expand
2005
2005
Mining chains of relations
F. Afrati
,
Gautam Das
,
A. Gionis
,
H. Mannila
,
Taneli Mielikäinen
,
P. Tsaparas
Industrial Conference on Data Mining
2005
Corpus ID: 410228
Traditional data mining applications consider the problem of mining a single relation between two attributes. For example, in a…
Expand
2001
2001
Why solutions can be hard to find : a featural theory of cost for a local search algorithm on random satisfiability instances
Josh Singer
2001
Corpus ID: 150298963
1998
1998
Optimization of correlation weights of the local graph invariants: Use of the enthalpies of formation of complex compounds for the QSPR modeling
A. Toropov
,
A. Toropova
1998
Corpus ID: 125535404
1998
1998
Use of graph invariants in QMSA and predictive toxicology
S. Basak
,
B. Gute
Discrete Mathematical Chemistry
1998
Corpus ID: 21845530
1993
1993
ON THE NON-OCCURRENCE OF THE COXETER GRAPHS β2n+i, D2n+i AND EΊ AS THE PRINCIPAL GRAPH OF AN INCLUSION OF II! FACTORS
V. Sunder
,
A. Vijayarajan
1993
Corpus ID: 59130560
After discussing some preliminaries on the notion of an action of a hypergroup on a set, we present elementary proofs of the fact…
Expand
1993
1993
Morgan revisited
J. Figueras
Journal of chemical information and computer…
1993
Corpus ID: 10360537
Ever since its description in 1965, the Morgan algorithm’ has been important in computer applications that handle chemical…
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