Metric Number In Dimension

Henry Garrett Independent Researcher DrHenryGarrett@gmail.com Twitter’s ID: @DrHenryGarrett | c ©B08PDK8J5G Abstract In this outlet, I’ve devised the concept of relation amid two points where these points are coming up to make situation which in that the set of objects are greed to represent the story of how to be in whatever situations when these two points have the styles of being everywhere in the highlights of the concept which are coming from the merits of these points where are eligible to make capable situation to overcome every situation when they’re participant in the hugely diverse situations which mean too styles of graphs with have the name or the general results for the general situation as possible as are.

1 Preliminary On The Concept 1 I'm going to refer to some books which are cited to the necessary and sufficient material 2 which are covering the introduction and the preliminary of this outlet so look [Ref. [1], 3 Ref. [2], Ref. [3], Ref.
[5] is kind of disciplinary approaches in the good ways.

10
• (Number) The NUMBER is the type of parameter which in that, the number of 11 objects in resolving sets, has the peers in the dimension.   The complete bipartite graph is the metric number in dimension.

20
Proof. Every vertex from any part couldn't resolve the vertex in its peer in the 21 opponent part. So the given set from one vertex in one part and one vertex in another 22 part, make the number two as reminder so the graph is metric number in dimension. To 23 capture it precise, there's two given vertices so there's four cases,

24
• two vertices belong to same part. So the vertex in the set, which is corresponded 25 to this part has the distance two and the vertex in the next to part, has the 26 distance one. So in this case, two vertices aren't resolvable.

27
• one vertex in one part and one vertex in another part. These two given vertices, 28 could be solvable by any vertex which is given. Because there's the distance one 29 and there's the distance two so in the case which the part for two vertices, is the 30 same, the distance is two and in the case, two vertices have the different parts, the 31 distance is one.

32
• If two given vertices belong to same parts, then adding all vertices to the resolved 33 set in the way that, there's one vertex in any part out of the resolved set so there's 34 two vertices for resolving which are resolvable because they aren't in same part.

35
• Two given vertices have been left aside like there are isolated so these two vertices 36 is the complement of the resolving set. The star graph is the metric number in dimension.

40
Proof. The center of this graph is unique and other vertices have the same positions so 41 two vertices which one of them is center, are the only vertices which could be resolved. 42 Center and one given vertex which is different from center, are two only objects for the 43 process of resolving so the graph is metric number in dimension. In other words, there 44 are only two vertices for being resolved and more than two vertices couldn't be resolved. 45 To capture the details, there are four cases.

46
• If two vertices are non-center, then the distance from the center vertex is one and 47 the distance from non-center vertices are two. So the styles of these two vertices 48 are the same and there aren't any vertices to resolve them.

49
• If more than two vertices are on demand to be resolved, then at least, two vertices 50 are non-center so the discussion goes back to the previous case.

51
• One center vertex and one non-center vertex have been chosen to be resolved. The 52 center vertex is chosen so the latter are non-center vertices. Any given non-center 53 vertex has the distance one from center vertex and has the distance two from 54 non-center vertex so they're resolved.

55
• Two vertices are relatively isolated in the matter of resolved set so this set is the 56 complement for resolved set.
Proof. The wheel graph is the graph in that, the distance amid all vertices or precisely, 61 the distance amid any two given set is one. So there's no vertices out of resolved set 62 which means that the counterpart and complement of resolved set is empty set. The path graph, cycle graph and ladder graph isn't the metric number in dimension. 65 Proof. The resolved set for the path graph and the ladder graph, is singleton. The 66 resolved set for cycle graph, is two given vertices. So these graphs are metric number in 67 dimension if and only if they've three vertices for the case path graph and ladder graph 68 and four vertices for the case cycle graph. 69

70
Finding the ways in that, fundamental parameters of graphs are related to this concept.