2012
DOI: 10.1007/s00009-012-0230-4
|View full text |Cite
|
Sign up to set email alerts
|

On Connected 2-K n -Residual Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…We know that these supporting results are summarized in residual graph [7][8][9][10][11][12][13][14][15][16]. In this paper, we will study the important properties of hyperplane complete graph in relain to the minimum order of hyperplane complete graph and the minimum graph of hyperplane complete graph.…”
Section: Introductionmentioning
confidence: 99%
“…We know that these supporting results are summarized in residual graph [7][8][9][10][11][12][13][14][15][16]. In this paper, we will study the important properties of hyperplane complete graph in relain to the minimum order of hyperplane complete graph and the minimum graph of hyperplane complete graph.…”
Section: Introductionmentioning
confidence: 99%