Class information for:
Level 1: RESTRICTED EDGE CONNECTIVITY//SUPERCONNECTIVITY//DEGREE DIAMETER PROBLEM

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
11682 899 14.8 44%


Bar chart of Publication_year

Last years might be incomplete

Classes in level above (level 2)


ID, lev.
above		 Publications Label for level above
1702 6130 RESTRICTED EDGE CONNECTIVITY//INTERCONNECTION NETWORKS//HYPERCUBE

Terms with highest relevance score


Rank Term Type of term Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 RESTRICTED EDGE CONNECTIVITY Author keyword 210 97% 7% 61
2 SUPERCONNECTIVITY Author keyword 44 100% 2% 16
3 DEGREE DIAMETER PROBLEM Author keyword 35 86% 2% 18
4 MOORE BOUND Author keyword 27 72% 2% 21
5 K RESTRICTED EDGE CONNECTIVITY Author keyword 26 100% 1% 11
6 SUPER EDGE CONNECTED Author keyword 23 86% 1% 12
7 RESTRICTED ARC CONNECTIVITY Author keyword 23 100% 1% 10
8 LINE DIGRAPH Author keyword 18 55% 2% 22
9 LAMBDA OPTIMAL Author keyword 17 100% 1% 8
10 RESTRICTED CONNECTIVITY Author keyword 15 77% 1% 10

Web of Science journal categories

Author Key Words


Rank Web of Science journal category Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class		 LCSH search Wikipedia search
1 RESTRICTED EDGE CONNECTIVITY 210 97% 7% 61 Search RESTRICTED+EDGE+CONNECTIVITY Search RESTRICTED+EDGE+CONNECTIVITY
2 SUPERCONNECTIVITY 44 100% 2% 16 Search SUPERCONNECTIVITY Search SUPERCONNECTIVITY
3 DEGREE DIAMETER PROBLEM 35 86% 2% 18 Search DEGREE+DIAMETER+PROBLEM Search DEGREE+DIAMETER+PROBLEM
4 MOORE BOUND 27 72% 2% 21 Search MOORE+BOUND Search MOORE+BOUND
5 K RESTRICTED EDGE CONNECTIVITY 26 100% 1% 11 Search K+RESTRICTED+EDGE+CONNECTIVITY Search K+RESTRICTED+EDGE+CONNECTIVITY
6 SUPER EDGE CONNECTED 23 86% 1% 12 Search SUPER+EDGE+CONNECTED Search SUPER+EDGE+CONNECTED
7 RESTRICTED ARC CONNECTIVITY 23 100% 1% 10 Search RESTRICTED+ARC+CONNECTIVITY Search RESTRICTED+ARC+CONNECTIVITY
8 LINE DIGRAPH 18 55% 2% 22 Search LINE+DIGRAPH Search LINE+DIGRAPH
9 LAMBDA OPTIMAL 17 100% 1% 8 Search LAMBDA++OPTIMAL Search LAMBDA++OPTIMAL
10 RESTRICTED CONNECTIVITY 15 77% 1% 10 Search RESTRICTED+CONNECTIVITY Search RESTRICTED+CONNECTIVITY

Key Words Plus


Rank Web of Science journal category Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 CUTS LEAVING COMPONENTS 86 96% 3% 26
2 BIPARTITE DIGRAPHS 31 92% 1% 12
3 K G CAGES 30 100% 1% 12
4 SUPERCONNECTIVITY 24 91% 1% 10
5 EXTRACONNECTIVITY 22 62% 3% 23
6 RESTRICTED EDGE CONNECTIVITY 21 75% 2% 15
7 MOORE GRAPHS 16 64% 2% 16
8 GENERALIZED PRISMS 14 100% 1% 7
9 CONDITIONAL EDGE CONNECTIVITY 12 86% 1% 6
10 DEGREE SEQUENCE CONDITIONS 11 100% 1% 6

Journals

Reviews


Title Publ. year Cit. Active
references		 % act. ref.
to same field
Maximally edge-connected and vertex-connected graphs and digraphs: A survey 2008 52 91 91%
LARGE FAULT-TOLERANT INTERCONNECTION NETWORKS 1989 56 26 58%
AN OVERVIEW OF DISCRETE METHODS IN THE SYNTHESIS OF RELIABLE NETWORKS 1984 1 2 50%

Address terms


Rank Address term Relevance score
(tfidf)		 Class's shr.
of term's tot.
occurrences		 Shr. of publ.
in class containing
term		 Num. of
publ. in
class
1 MATEMAT LICADA 3 13 16% 8.0% 72
2 MATEMAT LICADA TELEMAT 5 22% 2.2% 20
3 LEHRSTUHL MATH 2 4 13% 3.6% 32
4 ANHUI PROV MOST KEY CO HIGH PERFORMANCE COMP 2 67% 0.2% 2
5 MOBILE POSTDOCTORAL STN THEORET ECON 1 100% 0.2% 2
6 MATHS PHYS INFORMAT SCI 1 27% 0.3% 3
7 INFORMAT PL OPTIMISAT 1 25% 0.3% 3
8 COMP SCI ITI 1 50% 0.1% 1
9 DPT MATEMAT LICADA 4 1 50% 0.1% 1
10 FOR UNG DISKRETE MATH 1 50% 0.1% 1

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000193473 PACKING CHROMATIC NUMBER//DOUBLE LOOP NETWORK//TOEPLITZ GRAPH
2 0.0000141171 INTERCONNECTION NETWORKS//HYPERCUBE//INTERCONNECTION NETWORK
3 0.0000131121 RAINBOW CONNECTION NUMBER//RAINBOW CONNECTION//RAINBOW PATH
4 0.0000071723 PERMUTATION DECODING//GRASSMANN CODES//PD SET
5 0.0000071207 MINIMUM BROADCAST GRAPHS//PRIME LABELING//GOSSIPING
6 0.0000067671 SURVIVING RATE//FIREFIGHTER PROBLEM//DETERMINISTIC NETWORK MODELS
7 0.0000067359 NETWORK RELIABILITY//QUICKEST PATH//STOCHASTIC FLOW NETWORK
8 0.0000065660 GRAPH COVERING//EXTRACTORS//IHARA ZETA FUNCTION
9 0.0000064477 DIRECTED HYPERGRAPHS//SUBSET GRAPH//SET THEORETIC ALGORITHMS
10 0.0000056893 3 DIMENSIONAL BRAID//EL ARISH EDUC//FINITE SPACES