Charts
All Keyword:
molecular orbital method
block internal
(0, 1)-matrices
(3,6)-cage
(a,b)-linear graphs
(ê,ô)-Regular sets
0-Graphs
1-sum problem
2-connected graphs
2-Degree
2-design
2-dim W-L
2-factors
2-sum problem
2-Walk linear graphs
4-cycles
8-cage
a-representation
A-variation with repetitions
Abelian Cayley graphs
abelian sandpile
absolutely summing operator
accessory gland protein
Acyclic
Acyclic Birkhoff polytope
Acyclic graph
acyclic matrices
acyclic orientation
Acyclic set
addition of vertex
adjacency algebra
Adjacency eigenvalues
adjacency matrix
Adjacency operator
Adjacency spectrum
Adjacent transpositions
adjacent vertices
admissible partition
admissible vertex ordering
admittance matrix
admittance spectrum
Affine group over the finite ring
affine plane
AGX
Algebra
algebraic combinatoric(s)
algebraic connectivity
algebraic connectivity distribution
algebraic constructions
Algebraic Graph Theory
algebraic theory pertubations
algorithm deletion-contraction
algorithm Edmonds
algorithm reconstruction
algorithm(s)
alkane
Almost eigensharp graphs
Almost regular graphs
almost-complete
Alon-Boppana theorem
alphabet
alternating knot
alternating polynomial(s)
Amalgamation
amenable to switching
analysis of algorithms
Analytic combinatorics
Analytic performance evaluation
analytical theory pertubations
angle matrix
angle sequence
angles
angles main
angles partial
Annulene
antipodal
antipodal r-fold covering
applied mathematics
association scheme
asymptotic behaviour
asymptotic series
atomic orbital
Atom–bond connectivity index
Aufbau principle
augmentation
augmenting path
AutoGraphiX
automated system
Automatic generation of conjectures
automorphic
automorphism
automorphism group
automorphism of a graph
Average degree
Average degree of neighbors
Average distance
Azect diamond
B-product
bags
Baker theory
Balanced binary trees
Balanced incomplete block design
Balanced tree
Basis of NEPS
Benzene
Bethe tree
BIBD
bicentroid
bicomplete graph
bicyclic graph(s)
bigrading
binary clutters
binary tree(s)
Binomial coefficient graph of characteristic n
Biological network
bipartite
Bipartite crossing number
Bipartite density of graph(s)
bipartite graph(s)
Biphenyl
biplane
biquadratic form
Birkhoff polytope
Bisection
block design
Block diagonal sum of a matrix
Block graphs
Block Krylov space method
Block Krylov space solver
Block of a digraph
Block size reduction
block system
block terminal
block trivial
Boiling point
bond length
bond order
bond-order matrix
Boolean function of graphs
Boolean operations
Bottleneck matrix
bound absolute
bound Chernoff
bound(s)
boundary operator
bounded degree
branch
branch internal
branch terminal
Branching of trees
Bridge
bridged cliques
bridging vertex
Broadcast tree
broken cycle
broken wheel
Brooks´s theorem
buckminsterfullerene
bugs
Butadiene
Butterfly digraph
C4-free graphs
cage
Canonical form of matrix
canonical graph ordering
canonical ordering weighted graph
canonical star basis
canonical tree
canonical vertex ordering
carbon skeleton
Cardinal product of graphs
Cartesian product
Cartesian product of graphs
Catalan´s constant
Caterpillar
Cauchy´s inequalities
Cayley formula
Cayley graph
Cayley-Hamilton theorem
centerpoints
central part of graph
centre
centroid
Chang graph
Character
character table
characteristic center
characteristic function
characteristic polinomial of a graph
characteristic polynomial
characteristic polynomial of a tree
characteristic set
characteristic vector
characterization
characterization of graphs
characterizations spectral
Chebyshev polynomials
Cheeger inequality
Chemical applications
Chemical Graph Theory
chemical graph(s)
chemical molecular
chemical stability
chemical tree(s)
chess board
chip-firing
Chip-firing game
Choice number
chordless cycle(s)
chromatic invariant
chromatic number
chromatic polynomial
chromatic root
chromatically unique
Circuit
Circulant graph
circulant matrix
class function
claw
Clebsch graph
clique
Clique number
Cliques, pair of bridged
cliquomatic number
closed neighbourhood
closed walk
clusters
Co-clique
co-immanantal trees
co-rank
coalescence
coarsening
Coates formula
coboundary mapping
cocktail party graph
coclique
code canonical
code perfect
Code, error-correcting
coderived graph
Coding theory
Codivisor
coefficient of ergodicity
coefficient pertubation
coenergetic graphs
cognitive science
coincidence-free NEPS
collection
Coloration, D-feasible
Coloring
colour-class
colour-partition
colouring regular
combinatorial analysis
Combinatorial Laplacian
combinatorial matrix theory
Combinatorial Optimization
combinatorial problem(s)
combinatorics
Commutativity
compatibility graph
compatible
Complement of a graph
complementary Laplacian
complete bigraph
complete bipartite graph
complete bipartite subgraphs
complete graph(s)
complete intersecting family
complete invariant
complete k-partite graph
complete matching
complete multipartite graph
complete product
complete r-partite graph
complete system of cliques
Complete tree
complete tripartite graph
complex networks
Complex, linear
Complexity of a graph
component
Component of graphs
composition of graphs
compound matrix
Computational complexity
computer
computer-assisted
concavity of eigenvalues
condition bridge
condition edge
condition number
conductance
cone
configuration, coherent
confluence
conformal mapping
conforms
conjecture(s)
conjugacy class
conjugate Bell polynomials
Conjugate gradient minimization
conjugate of a degree sequence
conjugated molecules
conjunction
connected cospectral graphs
connected graph(s)
Connected graphs with order ¡Ü 10
connection from i to j
connectivity
connectivity algebraic
connectivity edge
connectivity index
connectivity of a graph
connectivity vertex
consecutive ones property
Consecutive orderings
Contracted tree
contracting
convex programming
convex set(s)
Conway´s presentations
cordal graph(s)
corona
correlated fluctuations
coset graph
cospectral digraph
cospectral forests
cospectral graph(s)
cospectral pairs of vertices
cospectral trees
cospectral vertices
cospectrality of graphs
costs
Coulson-Rushbrooke Pairing Theorem
Coulson´s bond-order matrix
Courant-Weyl inequalities
cover
covering graph
Covering number
Coxeter graph
Coxeter system
cp-rank
cpmplex networks
critical group
cube
Cube, n-dimensional
cubic
cubic exceptional graph
cubic graph Lattice
cubic graph(s)
current
curvature flow
cut
cut edge
cut set
cut vertice(s)
cut-orientation
cut-subspace
cutpoint(s)
cycle
cycle graph
cycle prefix digraph(s)
cycle space
Cycle spectrum
cycle type
cycle vector
cycle-orientation
cycle-subspace
cyclically equivalent walks
cyclically k-partite graph
cyclomatic number
cyclotomic polynomial
d-girth
data reduction
databases
decentralized control
deck
Decomposable graph
decomposable line system
Decomposition
Deflation
Deflection routing
degree
Degree condition
Degree distance
degree matrix
degree sequence(s)
deletion-contraction
Delta conjecture
Dense graphs
density
density matrix
dependent lines
derived graph
Desargues graph
design, symmetric
determinant
Determinant identity
determinantal measure
Determined by spectrum
Deterministic probability transition matrices
diameter
Diameter problem
Digraph coloring
digraph Konig
digraph with weighted adjancencies
digraphs
dihedral group
dimension of line system
dimer
Dimers
diophantine equation
direct sum
direct sum of matrices
directed edge
directed graph
direction main
Dirichlet eigenvalues
disconnected graph
discovery
discrete groups
Discrete Laplacian
Discrete Riemannian geometry
Discrete Schrödinger operator
discrete spectral geometry
dismantling of a graph
dissection
Distance
Distance energy
Distance matrices
distance polynomial
Distance spectra
Distance spectral radius
distance-regular digraph
distance-regular graphs
distance-transitive
distinct eigenvalues
distributive lattice
divisor
dodecahedron
domain partitioning
dominating set
dominating set minimal
domination number
double cone
double pyramid
double star
double-m-property
double-transitivity
doubly regular tournament
doubly stochastic matrix
Drosophila
drum shape
dual
Dual graph
dual lattice
dual representation
dynamic cores
dynamic mean of the valencies
dynamical systems
Dynkin diagram
E-eigenvalue
è-Graphs
E-polynomial
EA-reconstructible invariant
EA-reconstructible property
edge
Edge addition
Edge coloring
edge cut
edge density
edge separators
edge space
edge subdivided
edge version
edge-covering
edge-transitive
effective resistance
Efficient computability
eigenfunction
eigensharp graphs
Eigensolution
Eigenspaces
eigenspaces of graphs
Eigenvalue
eigenvalue -2
Eigenvalue analysis
Eigenvalue bounds
eigenvalue gap
Eigenvalue interlacing
eigenvalue main
eigenvalue multiplicity
eigenvalue of a graph
Eigenvalue problems
eigenvalue second largest
eigenvalue simple
Eigenvalue spectra
Eigenvalue sum
eigenvalue zero
eigenvalues
eigenvalues conjugate
eigenvalues corresponding
eigenvalues inequalities
eigenvector
eigenvector matrix
eigenvector non-negative
Eigenvector of a graph
eigenvector partial
eigenvector principal
Elasticity
electrical network
electron charge
electronic energy
elementary
Elementary equivalence
Embedding
endospectral graphs
ends
Energy
energy of graph
Energy of matrices
Energy of matrix
envelope (space)
envelope reduction
equiangular lines
Equienergetic
equienergetic graphs
equilibrium measures
equipartition
equitable partition
Erdös-Stone-Bollob´as theorem
Erdös-Stone-Simonovits theorem
Estrada index
Ethylene
Euclidean 2-distance set
Euclidean 2-distance set
Euclidean representation
Eulerian graph
Euler´s theorem
eutatic star
even function
even graph
even lattice
even subgraph
even triangle
even-odd bipartite graph
exceptional graphs
excess
exit-value
expanders
Expanding factor
expansion
Expansion graphs
Expectation
Explicit description of boundary conditions
exponent
expression tree
extendability graph
extended p-sum of graphs
extension
external activity
externally active
Extremal (n,m)-graphs
extremal degrees
Extremal energies
extremal graphs
Extremal matrix theory
extremal tree
Extremal values
extreme eigenvalues
face
factor
factor generalized
factor linear
factor quadratic
factor regular of degree
Factor width
factorization
Faria vector
feasible array
Feasible Parameter Set
feasible partition
Fibonacci numbers
Fiedler vector
Field of values
Fields & Rings
figure
Finite element
Finite frame
finite graph
Finite group
Finite metric space
Finite rank perturbation
first, second, third, layer
flow
flow polynomial
Foodweb
forbidden subgraph
forest
Formation stability
Forwarding index
Foster´s census
foundation
Fractures
friendship graph
friendship theorem
front neighbour
front valency
fullerenes
function spaces
fuzzy image
g-deck
Gain graphs
Galaxy graph
Gauss sums
GCP
gene duplication
gene expression
general graph
Generalized Bethe trees
generalized cocktail-party graph
generalized d-gon
generalized direct product
generalized divisor
generalized inverse
Generalized Laplacian
Generalized line graph
generalized matching
generalized multi-digraph
generalized polygon graph
generalized stars
generalized vertex degrees
generating function for the number of walks
Generating polynomial
Generation
generic characteristic poliynomial
Genus
Geodesic
Geodetic number
Geodetic spectrum
geometric expanders
Geometric graphs
geometric inequality
geometric sampling
Geometric transformation
geometry, projective
Gershgorin circle criterion
girth
Girth bound
GLG
Golden ratio
Grade
graffiti's conjecture
Gramian matrix
graph
Graph algorithms
graph and geometric algorithms
graph angles
Graph bundle
Graph clustering
Graph composition
Graph covering
Graph decomposition
graph eigenvalues
Graph eigenvalues and eigenvectors
graph eigenvectors
graph embeddings
Graph energy
graph equations
Graph evolution
Graph expansion
Graph index
Graph invariants
graph isomorphism
Graph join
graph Laplacian
graph Lattice
Graph minor
Graph operations
graph partitioning
graph poliynomial
Graph product
graph reconstruction problem
graph spectra
graph spectral radius
graph spectrum
graph symmetry
Graph tetrahedral
Graph Theory
graph totally disconnected
graph types
graph weakly symmetric
Graph with three eigenvalues
graphic partition
Graphic Sequence
graphical regular representation
Graphs
graphs of regular solids
Graphs with no 4-cycles
Grassmannian frame
Green’s Function
Grothendieck theorem
group of a graph
group of quaternions
group of symmetries of a molecule
group orthogonal
group unitary
H-matrices
Hadamard matrices
Hadamard matrix
Hadamard matrix functions
Hadamard powers
Hamiltonian
Hamiltonian circuit
Hamiltonian cycle
Hamiltonian graph
Hamiltonian path
Hamiltonicity problem
Hamming distance
Hamming graph
Hankel determinant
Hardy–Littlewood method
Harmonic digraph
Harmonic graphs
harmonic oscillations
Healing
Heawood graph
Height characteristic
Heilbronner formula
hereditary property
Hermitian
Hermitian matrices
Hermitian matrix
Heuristic
Hexagonal tessellation
Hierarchical product
High girth
Hoffman polynomial
Hoffman-Singleton graph
homeomorphic
homogeneous
homological covering
Hopf algebra
Hosoya index
Huckel matrix
Huckel´s theory
hybrid systems
Hückel molecular orbital (HMO)
Hückel trees
Hydrocarbon acyclic
Hydrocarbon alternant
Hydrocarbon benzenoid
Hydrocarbon cata-fuzed
Hydrocarbon conjugated (aromatic)
hydrocarbon molecules
Hydrocarbon saturated
Hydrocarbon unfuzed
hydrocarbons
hydrophobic
hyperbolic graphs
Hypercube
Hyperenergetic graph
hypergraph partitioning
hypergraphs
hypermetric spaces
hyperoctahedral graph
hyperplane arrangements
Hypoenergetic
icosahedral
Icosahedron graph
ideal clutters
Ihara–Selberg trace formula
image decomposition
immanant
immanantal polynomial
imprimitive matrix
Incidence energy (of graph)
incidence graph
incidence mapping
incidence matrices
incidence matrix
incidence modified
incident edges
incomplete p-sum of graphs
Incomplete torus
indegree
independence number
independent
independent component analysis
independent cycles
independent edges
independent sets
independet vertices
index
Index of graphs
index of imprimitivity
index of mobility
index topological
indicator function
induced matchings
induced subgraph
induced subgraph property
Inertia
infinite graphs
Information theory
initial layer
integer eigenvalues
integral basis
Integral circulant graph
Integral eigenvalue
integral graph
integral lattice
Integral sum graph
Integral sum number
integral trees
Integrity
interaction model
interchange graphs
Interconnection networks
interior stability
Interlace polynomial
Interlacing inequality
interlacing Theorem
intermediate eigenvalue problems
internal activity
internal path
internal stable set
internal triangle
internally active
Internet graphs
intersecting family
intersection array
intersection matrix
intersection numbers
invariant
Inverse Eigenvalue Problem
Inverse graph
Inversions
involution
irreducible character
irreducible component of a representation
irreducible matrices
irreducible matrix
Irreducible representations
Irregular graph
irregular tessellation
irregularity
Ising model
ising problem
Isomap
isomorphic graphs
isomorphism
Isoperimetric constant
isoperimetric inequality
isoperimetric numbers of graphs
Isoperimetric peak
isoperimetric properties
isospectral graphs
isospectral molecules
isospectral trees
isthmus
iterated line graphs
J-sum of graphs
Jacobi formula
Jacobian
join
Jones polynomial
Jordan chains
Jordan matrix
Jordan normal form
k-ary n-cube
K-chain
k-Coloring
k-colourable graph
k-degenerate graph
k-partite complete
k-Primitivity
k-reduced spanning substructure
kekulé structure
Kelly´s lemma
Kernighan-Lin heuristic
kinetics
king
King´s move (chess)
Kirchhoff´s laws
knight
Kocay´s lemma
Krein parameters
Kronecker product of matrices
Ky Fan theorem
L-equienergetic
L-equienergetic graphs
L-function
labelled tree
ladder
Lagrange's multiplier rule
landscapes
language
Laplace matrix of a graph
Laplace transformation
Laplacian
Laplacian coefficients
Laplacian eigenvalues
Laplacian energy
Laplacian Estrada index
Laplacian graph eigenvectors
Laplacian Integral
Laplacian integral graph
Laplacian matrix
Laplacian matrix (of graph)
Laplacian matrix-eigenvalue protein folding
Laplacian of a graph
Laplacian operator
Laplacian separator
Laplacian spectral radius
Laplacian spectrum
Laplacian spectrum (of graph)
Laplacian spread
laplacian-like energy
Laplacians
Large energy
large-scale design
Largest degree
Largest eigenvalue
Latin square type
lattice
lattice graph
Lattice graph of characteristic n
LCAO-MO method
Least eigenvalue
length of a circuit
length of a cycle
length of a path
length of a walk
Level characteristic
Levi graph
Lévy–Desplanques Theorem
limb
limit point
Limit points
limit points of Laplacian spectra
line graph
line graph of a design
line multidigraph
line star cell
line star complement
line star partition
line system
line-regular factorization
line-switching equivalence
Linear & Multilinear Algebra
linear directed graph
linear directed subgraph
Linear discriminant analysis
Linear forms of logarithms
Linear perturbations
linear representation of a finite group
linear spanning subgraph
linear undirected subgraph
linked cliques
Littlewood conjecture
Lloyd´s Theorem
load balancing
Local character
local density
Local multiplicity
local spectrum
Local switching
location-dominating set
location-domination number
logarithmic transform
Longet-Higgins model
loop
Lorentz space
lower bound(s)
M-combination
Main angle
Main eigenspaces
Main eigenvalues
main part spectrum
main vector
majorization
Making graphs bipartite
Manhattan street networks
Markov chain
Mass-spring vibrating system
Matching
matching number
matching problem
Matchings
mathematical physics
Matlab
Matrices
matrices symmetriques
matrix
Matrix algebra
Matrix energy
Matrix equation
Matrix of permitted pairs
Matrix of restrictions
Matrix polynomials
matrix theory
Matrix Tree Theorem
matrix valency
matroid
matroid intersection problem
matroid theory
Max cut
Maximal
maximal clique problem
maximal eigenvalue
Maximal energy
maximal exceptional graph
maximal graph
maximal indecomposable line system
Maximal independent set
maximal index
maximal outerplanar
maximal star-closed line system
Maximum degree
maximum matching
Maximum multiplicity
Maximum nullity
Maximum principle
McClelland inequality
mean
measure of irregularity
medial graph
membrane, combinatorial graph
Menger's theorem
Merris graph
Merris index
Merris’ conjecture
Mesh
mesh partitioning
mesoscopic system
Metabolic network
Metaheuristic
metrically regular graph
minimal energy
minimal exceptional graph
minimal forbidden subgraph
minimal line graph
minimal non-generalized line graph
minimal polynomial
minimal support
minimal volume
Minimum cuts
Minimum degree
Minimum Rank
minors
mixed graphs
Mobius ladder
model decomposition
modified rank polynomial
modified weight-generated graph
modular flow
molecular
molecular evolution
molecular graphs
molecular orbital
moment of inertia
Moore graph
Motzkin-Straus formula
Muirhead’s lemma
Multi-interval Sturm–Liouville problems
multidigraph
Multidimensional scaling
multidisciplinary design
multigraph
multiple edge
Multiple eigenvalues
Multiple right-hand sides
multiplication of a graph by an integer
Multiplicity
multiplicity (algebraic, geometric) of an eigenvalue
Multisection
Mutually unbiased basis
M–matrix
Naphtalene
natural partition
negative end
Neighbour
NEPS
Nested split graph
network
Network reliability
Networks
Neuronal network
Newton´s formulas
Nice cycle
nodal domains
Nodal ordering
non-bonding molecular orbitals
Non-complete extended p-sum
non-derogatory Matrix
Non-negative matrix
non-singular substructure
nonbipartite graph
Noncospectral graphs
nonhomogeneous variational problem
Nonlinear dynamics
nonlinear variational problem
nonnegative matrices
nonregular graphs
Nordhaus-Gaddum
Nordhaus–Gaddum type problem
normal digraph
normal matrix
normalized immanant
Normalized Laplacian
nowhere-zero
NP-complete
Null space
Nullity
Number of components
number of edges
Number of Faces
number of pentagons
number of quadrangles
number of spanning trees
number of triangles
Number of vertices
number of walks
Numerical Algebra
Numerical radius
o-representation
octahedron
Odd cycle
odd function
odd graphs
odd triangle
odd-unicyclic graph
Off-diagonal rank
one line extension
open neighbourhood
Operations on graphs
optimality conditions
orbit
orbit algebra
orchid
orchid garden
order ideal
Ordering
Ordering algorithms
Ordinary character
orientation
Orthocentric matrix
Orthocentric simplex
orthodox star basis
orthodox star partition
Orthogonal matrix
orthogonal polynomials
outdegree
Ozeki inequality
p-deck
p-electron
P-spectrum
p-sum of graphs
Pairing theorem
Paley graph
Pancake problems
Pappus graph
parallel finite element analysis
parallel processing
parameters
parity of a separation
partial
partial geometry
partial graph
Partial linearizations
partial ordering
partial spectrum
partially balanced incomplete block design
partition
partition function
Partition lattice
partition number point arboricity
partitioned matrices
partitioning algorithms
Partitions
partners
path
Path complete graph
path graph
path-like cubic
path-positive graph
path-zero graph
Pauli´s principle
pendant edge
Pendant vertex
Pendent vertices
Percolation
perfect code
perfect matching
Perfect state transfer
periodic graph
periodical graph
Peripheral eigenvalues
peripheral vertex
perm-polynomial
permament
permanental dominance conjecture
permanental polynomial of a graph
permanental polynomial of a matrix
permutation
permutation character
permutation matrix
Perron branch
perron component
Perron eigenvalue
Perron eigenvector
Perron pair
Perron root
Perron value
Perron vector
Perron-Frobenius theorem
perturbed
perturbed matrix
petal
Petersen graph
Pfaffian orientation
phenanthrene
pi-electron energy
Picard group
PING
planar
planar graphs
Planar triangulation
Planck´s constant
plane graph
Platonic solids
point arboricity
Polya-Szego inequality
Polyene conjugated
polygon generalized
Polyhedra
polymer networks
polynomial of a directed graph
polynomial of a graph
polynomial of a multigraph
polynomial partition
polynomial reconstruction
polynomials
Polynomials of binomial type
polynomials on graphs
polytope
poset
positive end
potential
Potts model
power
Prescribed girth
previous termTree
prime graph
primitive
primitive directed graph
primitive matrix
Primitivity index
principal component analysis
principal eigenvalue
principal minors
prism n-sided
probability
Processor array
product lexicographic
product of graphs
programming involving graphs
projection
projective plane
projective representation
proof
proper
proper cover
proper divisor
properly coloured graph
Protein–protein interaction network
Pruned torus
Pruning strategy
pseudo-net-graph
Pseudo-regular graph
Pseudo-semiregular bipartite graph
pyramid
Q-Index
Q-integral graph
Q-spectrum
Q-spectrum of a hypergraph
quadrangle
Quadrangle-containing (-free)
quadratic assignment problems
Quadratic programming
Quadriculated disk
Quantum nonlocality
quasi-bipartite graph
quasi-bridge
quasi-canonical star basis
quasi-graph
Quasi-ordering
quasi-separable
quasi-separation
quasi-strongly regular graph
Quipus
r-partite subgraphs
r-ply transitive
radius
Ramanujan graphs
Ramsey theory
Randic´ index
random
random graph
Random walks
rank
rank group
rank matrix
rank polynomial
rank three graph
rank-coloring conjecture
Rational representations
Rayleigh monotonicity
Rayleigh quotient
Rayleigh´s monotonicity law
Reciprocal complementary Wiener number
recognition
reconstructibility of a graph
reconstructible
reconstruction conjecture
Reconstruction Lemma
reconstruction problems
Reconstruction theorem
Recursive coatom ordering
recursive family
reduced simple molecular orbital theory
reduced Smith graph
reducible matrix
reduction
reflection
refutation
regular
regular action
Regular cell complex
regular cospectral graphs
regular exceptional graph
Regular graph
regular polytopes
regular two-graph
regular-stable graphs
reordering algorithms
Representable graph
Resistance distance
Resolvent
resonance theory
resonant model
Reverse Cauchy-Schwarz inequality
Reversible Markov chain
rewriting rules
RNA second structure
rook
rook´s move
root graph
root multigraph
root system
Rooted directed spanning tree
Rooted spanning forest
round-robin tournament
Routing
Ruch–Gutman criterion
Ryser switch
Sachs' theorem
Sandpile group
saturated chain
Scale free networks
schelling segregation model
Schlafli graph
Schlicht graph
Schrodinger´s equation
Schröder number
Schrödinger operator
Schultz index
Schultz polynomial
Schur complement
Schur´s lemma
Schwenk formula
second eigenvalue
second eigenvector
Second largest eigenvalue
Second-maximal
secular equation
Seidel matrix
Seidel spectrum
Seidel switching
selection
self-adjoint eigenvalue problems
Self-adjointness
self-complementary graph
self-converse tournament
Self-similar
semi-direct product
semi-edges
semi-regular bipartite
Semiregular bipartite graphs
semiregular graph
separable
separated form of a representation orbit
separation
separators
seriation
series-parallel
Several right-hand sides
sextet graph
Shannon capacity
shape description
shape of a drum
shifited shape
Shrikhande graph
sides
sign graph
Signal processing
Signless Laplacian
Signless Laplacian matrix
Signless Laplacian matrix (of graph)
Signless Laplacian spectral radius
Signless Laplacian spectrum
sigraph
similar matrices
similar vertices
simple eigenvalues
simple graph
simple molecular orbital theory
simply counted Loop
sing-nonsingular matrix
Singular linear systems
singular value inequality
Singular value of matrix
Singular values
sizes (dimensions)
Skew adjacency matrix
small index property
Small world networks
small-world structure
smallest eigenvalue
Smith graph
smith normal form
Sobolev inequality
Sorting by reversals
sorting in rounds
Spanning forest
spanning subgraph
spanning tree
Sparse linear systems
sparse matrices
sparse matrix
Spatial analysis
Spectra of a graph
Spectra of graphs
spectra of infinite hypertrees
Spectral bisection
spectral bounds
spectral characteristics
Spectral characterization
spectral decomposition
Spectral determination
spectral graph theory
spectral integral variation
Spectral moments
Spectral multiplicity
spectral partitioning
Spectral plot
Spectral properties
spectral properties of graphs
spectral radius
Spectral radius of nonnegative matrices
spectral spread
Spectral techniques
Spectral theory of positive operators
spectral threshold
spectral Turán theorem
spectrally bounded graph
Spectrally unique graph
spectrum
Spectrum (of graph)
Spectrum of a graph
Sphere packing
spherical set of vectors
Sphericity
split graph
splitting results
sporadic groups
Spread
square lattice
Square lattice on a torus
Square tessellation
Stability criteria
stability number
stabilizer
stabilizer sequence
standard bases
Standard Laplacian
standard representation
star
star cell
star complement
star covered
star degree of a graph
star graph
star of vectors
star partitions
star set
star types
star-closure
starlike trees
stationary vector
Steiner graph
Steiner triple system
stepwise adjacency matrix
stochastic matrix
strict graph
strict partition
string representation
strong component
strong graph
strong product
strongly connected graph
strongly regular graphs
structural parameters
Styrene
Subconstituent algebra
subdividing
subdivision graph
subgraph
subgraph spanned by its edges
subgraph spanned by its vertices
Subgraphs of graph
subgraphs theorem
Subpancyclicity
subspectral graphs
subspectral molecules
substitution vertex
subtree
successor
Sum graph
Sum number
Sum of entries
Sum of squares
superconcentrators
supercycle
support
Surface
suspension
switching
switching-equivalence
Symmetric
symmetric cycle
symmetric design
symmetric group
symmetric matrices
Symmetric network
symmetric tree
symmetry
synchronization
Szeged index
t-arc
T-polynomial
T-shape trees
t-transitive
tail of graph
Tensor product
Terwilliger algebra
test and evaluation
tetracyclic graphs
tetrahedral
tetrahedral graph
tetrahedral group
the Banach–Mazur distance
the greatest Laplacian eigenvalue
the kth eigenvalue of a tree
the largest eigenvalue
the second largest eigenvalue
the smallest greatest Lapalacian eigenvalue
thermodynamic limit
theta graph
Thin irreducible module
third largest
third smallest eigenvalue
Third-maximal
Thomson´s principle
thoughness of a graph
Threshold graph
Threshold partition
Tight frame
tiling
Tilings by dominoes
Tolerance graphs
topological effect on molecular orbital (TEMO)
Topological indices
Topological indices
topological Matrix
Topology
Topology of network
toroidal cage
toroidal fullerene
toroidal graphs
Torus
total graph
totally reduced form of a representation
totally unimodular matrix
tournament
trace
Transcription network
transfer graph
transfer matrix
transition probability
transitive automorphism group
Transport
transportation in graphs
Transportation problem
transposition
tree
tree-like cubic
tree-number
tree-width
Treelike graphs
trees
Triangle
Triangle-free graph
triangles in a graph
triangular association scheme
triangular graph
tricyclic graphs
tricyclic Hamiltonian
tridiagonal
tridiagonal Birkhoff polytope
trivalent graph
Turan´s theorem
Tutte polynomial
Two angle frame
Two largest multiplicities
two-dimensional Lattice
two-graph
Ulam´s conjecture
Umbral calculus
umbral chromatic polynomial
undirected graph
unicyclic
unicyclic graph
Unicyclic molecular graph
uniform hipergraph
Uniformly locally finite graphs
unimodal conjecture
union of graphs
Unique perfect matching
unit cube graph
Unit eigenvector
Unitary Cayley graph
Unitary matrix
Universal cover
unrestricted substitution vertex
unrestricted vertices
unsaturated hydrocarbon
upper bound
V-function
valency
valency orbit
Validated bounds
Variable Neighborhood Search
variation
Vector & Tensor Analysis
vector product
Vehicles
vertex
Vertex centrality
vertex connectivity
vertex of type a or b
Vertex PI index
Vertex reconstruction problem
vertex space
Vertex weight
vertex-colouring
vertex-deleted subgraph
vertex-stabilizer
vertex-transitive digraph
Vertex-vertex proximity
Vertices
vertices of trees
view based recognition
Virtual cut-through
Voltage assignment
walk length
walk partition
walk-generating function
walk-generating matrix
walk-regular
Wave division multiplexing
wave equation
wave function
wavefronts
weakly bipartite graphs
weakly homogeneous
weight of an arc
weight-generated graph
weighted graphs
Weighted stability number
weighted tree
Weyl group
wheel
Whitney Theorem
wiener index
Wiener indices
Wigner’s semicircle law
windmill
word length
Yamabe flow
Young subgroup
Young's lattice
Zeroth-order general Randiæ index
Keyword:
select an year - start [9999]:
select an year - end [9999]: