Number Graphs And

Numbers
Ideas | Approaches | Accessibility | Availability

Henry Garrett
Report | Exposition | References | Research #22 2021
 Abstract

Number graphs are introduced and the kind of introduction for this type is
given. Assigning the numbers to the graphs could be done in various ways. One
of them is elected and the efforts are done to make sense about the ways of
concluding to good results. Study is done on this types which are based on
numbers. The theory of number graphs could be one suggestion to be on to-do
list to get some interesting results about number graphs and numbers.
Picking one number and after that the kind of algebraic operators from the style of
numbers. The kind of visions is based one numbers. Numbers are deciders about how
goes the story of number graphs. The consequences of having numbers could get the
proper tools to be elected and to be in toolbox.

i
 Acknowledgements

The author is going to say his gratitude and his appreciation about the brains
and their hands which are showing the importance of words in the framework
of every wisdom, knowledge, arts and emotions which are streaming in the lines The words of mind and the
from the words, notions, ideas and approaches to have the material which is minds of words, are too
eligible to be in the stage
only the way to flourish the minds, the growing the notions, advancing ways of aknowledgements
and making the stable ways to be amid the events and storms of minds for
surviving from them and making the outstanding experiences about the tools
and ideas to be on the star lines of words and shining like stars, forever.

iii
 Contents

Abstract i

Acknowledgements iii

Contents v

1 Common Language As Viewpoint 1

2 Number Of Fundamental Parameters 5

3 Types Of Number Subgraphs 9

4 Number Of The Vertices 11

v
 CHAPTER 1

Common Language As Viewpoint

Assigning
numbers to Number of edge, Number of vertex, number of consecutive vertices, and number
mathematical of couple of vertices. Numbers! A graph is about two different types of objects
objects when the but number graph is a graph which is number-ized. It means all notions have
kind of
translation to
translated to numbers. Therefore, there’s the natural question about relations
numbers are amid these two styles.
useful. Question. What-if

• Minimum number amid the couple of number of vertex is at least the

number of edge amid them. So there’s the new definition about number
graph.

• Maximum1 number amid the couple of number of vertex is at most the

number of edge amid them. So there’s the new definition about number
graph.

• There’s no rules amid these two types of objects.

• There’s analogous rules amid these two types of objects.

Number of edge and number of vertex are discussed to make number of graph.
A graph is the picture which have been constructed by points and lines. The
point is called to be vertex and the line is called to be edge. For example,
picture depicts two types of graph and number graph. A PATH could be

Figure 1.1: Graphs And Number Graphs NG1

defined amid couple of vertices as starting vertex and ending vertex in both
graphs and number graphs but number-ization of path are different when the
sequence of consecutive vertices from starting vertex to ending vertex have
been considered, there’s one idea to define the NUMBER of path which is the
1 It is left but in upcoming chapters, it’s coming up with details.

1
1. Common Language As Viewpoint

minimum2 edge in this sequence. For example. picture 1.1 depicts some notions,
consider v2 and v4 in the way to get scrutiny on all parameters which are
related to path amid them. There are two paths v2 v3 v4 and v2 v1 v4 . Therefore,
the amount of path amid two specific vertices are obtained so as the extension,
there’s one general result. In this graph, amid every two given vertices, there
are forever two paths amid them. The amount of all paths in this graph, is six
paths. There’s natural question to obtain the general formula for all graphs
and number graphs which are in this case have the same results because from
the specific attributes of number graphs haven’t been used so this discussion is
general for both graphs but when the number is up. The discussion could take
the customized style to be up for number graphs.
Different kinds of paths could be defined as it mentioned comprehensively via
their clues to pursue in upcoming places. Obtained results concerning number
graphs is about the current definition of number of path amid v2 and v4 which
is 0.0001. To get general formula, number of all paths in this specific graph is
0.0001. To get general formula not only for this number graph but also for some
classes of number graphs need more scrutiny and making special environment
to get some classes of number graphs up to all number graphs. Path is the
amount number of vertices amid the couple of vertex so there’s the departure
from having two vertices amid two vertex in the notion of being neighbor and
having edges to having multiple vertices amid two vertex in the notion of path.
The path amid two vertices when the amount of vertices is two, is called to
be edge which is incident to these vertices and the vertices are the endpoints
of this edge. Fix one vertex, the set of all vertices with the path from order
two, is called neighbor of that vertex but it’s worthy to note that the order
of path is the amount of involved vertices which are equal or greater than
number two. The amount of neighbor of vertex is the amount of its vertices and
the number of neighbor of vertex is the summation of numbers of its vertices.
Therefore, there’s curious wondering about the extension of this notion to all
vertices which imply the number of vertex set is the summation of number of
all vertex of graphs. There’s analogy to edges in the way that the number of
edge-neighbors, number of edge-neighbors and number of edge set. Picking up
one number of object or summation of the number of objects are useful notions
to define new notion in the form of numbers.
The number of couple of vertices is defined on the notions of number of paths
in the balance approach which implies the maximum number of all paths amid
these couple of vertices where the number of path is the minimum number
of edge amid all involved edges. picture 1.1 depicts all paths have the same
number 0.0001 but the number amid any given couple of vertices is also 0.0001.
There are some questions about getting results when all paths have same
numbers or any given couple of vertices have the same number in customized
number graphs or general number graphs. There are new notions to compare
two numbers. The number of couple of vertices could be considered as the
footnote of this page, too. The kind of decomposition or change cause to have
multiple number graphs from the basis of number graph. If the subset of vertex
set and edge set are chosen, then the graph is called to be subgraph but there
2 the word minimum could be changed to be maximum, less than, greater than, strictly

less or greater than, having some constance or variable in the form of equation or summation
of all numbers of involved vertices or edges or both instead of considering one object, and etc.
as it’s expected to come up in upcoming chapters.

2
 are more conditions in number graphs where the number of all vertices and all
edges are the same with number of all vertices and all edges in basic number
graphs and the number graphs are called to be number subgraphs. In the
case that, the all numbers of the vertices are the same in both graphs and the
vertices are the same position and amount in number graphs, the number graph
are called to be number spanning graphs. There are some notions to create
graphs when the notions go to the edges or the notion of quality is replaced by
inequality about general, classes, specific graphs, vertex, edge and comparison
with other numbers.
Complete graph is the graph which in that, every given vertex has the path
from order two with all other vertex but in the number graph if the number of
edge has taken the sharp bounds which mean the minimum amid number of
its endpoints, then the number graph is called to be number complete graph.
The path with three vertices is called number star graph but there’s no named
graphs for other amount of involved vertices in the path. Number path is the
graph but number path is number star when the amount of vertices is three.
Number cycle is the cycle graph which have two same numbers for its edges
as the minimum number. Getting sharp bounds means number of edge is the
minimum number of its endpoints, if all edges get this number, the number
graph is called strong which is a number graph with number of vertices and
there are no independent number for edges but the number of edges are related
to number of its couple of vertices.

Exercises
1. Find motivations and practical applications when the new definition
of number graph is done by the replacement of maximum instead of
minimum.
2. Write down narrative story about number graph when the maximum
is elected instead of minimum.
3. Find multiple narrative story about number path when it’s happened
in new conditions to get new style.
4. Write down all possibilities to get results in the ways the advantages
and disadvantages are given clearly.
5. Get number graph from different kinds of graphs by different ways
of defining the number graph. Then obtain narrative story about
them.
6. Get number graph from different kinds of graphs by different ways
of defining the number graph. Then obtain narrative story about
them.
7. Consider a complete graph and define the different types of number
graphs on it.

3
 CHAPTER 2

Number Of Fundamental
Parameters

??????
To bring the sense, the formal definition of number graph implies the departure
from the couple of vertices in graph to the couple of function, precisely unary
operation on these two sets from graph to the unit interval [0, 1]. The Greek
letters for this second stage of graphs have been chosen to introduce couple of
independent unary operations which is restricted by the condition amid these
two unary operations in the way that, the image unary operation of edges is at
most the minimum of the image unary operation amid its couple of vertices.
There are two useful jargons incident and endpoint which is related to the
need for putting as the foundation. For example, when talking about the edge,
it’s useful to say edge and its endpoints but when talking about vertex, it’s
useful to say edge is incident to this vertex and that vertex. The notation of
V and E are chosen as the first letter of vertex set and edge set in the form
of English letter but the notation of N1 and N2 are chosen as the first letter
of unary operation with domain vertex set and edge set in the form of Greek
letter when the image of both unary operation is the same and is unit interval
[0, 1]. It’s interesting idea to use English letters for variable and sets but using
Greek letters for functions.
Definition 2.0.1 (NUMBER GRAPH). Let G = (V, E) be a graph. The
second style of graph which is obtained on it, is called NUMBER GRAPH,
denoted by N G = (N1 , N2 ) and it’s restricted by the inequality ∀e = xy ∈
E, N2 (e) ≤ N1 (x)∧N1 (y) where x and y are the endpoints of e and e is incident
to both x and y where N1 , N2 are two different unary operation N1 : V → [0, 1]
and N2 : E → [0, 1].
The order of a graph is amount of its vertices but the kind of numberization
of this notion in the number graph has the open way to sum number of all
vertices but it inspires us to catch bigger notion about any subset of vertex
set which leads us to the notion of NUMBER ORDER and NUMBER
VERTICES.
Definition 2.0.2 (NUMBER ORDER). Let N G = (N1 , N2 ) be a number
graph. The second style of order which is obtained on it, is called NUMBER
ORDER, denoted by O(N G) and it’s restricted by the equality O(N G) =
P
x∈V N1 (x).

Consider the set of vertices, the kind of enumeration is about counting the

5
 2. Number Of Fundamental Parameters

vertices but the kind of summation of number of vertices has used the structure
number graph.
Definition 2.0.3 (NUMBER VERTICES). Let N G = (N1 , N2 ) be a number
graph. The second style of set of vertices, S, which is obtained on it, is called
NUMBER PVERTICES, denoted by O(N V) and it’s restricted by the equality
O(N V) = x∈S N1 (x).
Definition 2.0.4 (NUMBER SIZE). Let N G = (N1 , N2 ) be a number graph.
The second style of size which is obtained on it, is called NUMBER
P SIZE,
denoted by S(N G) and it’s restricted by the equality S(N G) = e∈E N2 (e).
Definition 2.0.5 (NUMBER EDGES). Let N G = (N1 , N2 ) be a number
graph. The second style of set of edges which is obtained on it, is called
NUMBER P EDGES, denoted by S(N E) and it’s restricted by the equality
S(N E) = e∈E N2 (e).
Example 2.0.6. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. NUMBER ORDER is one and NUM-
BER SIZE is 0.0004. Amount of all sets of vertices with two mem-
bers is six and NUMBER VERTICES is 0.03, 0.04, 0.05, 0.05, 0.06, 0, 07 for
the sets {v1 , v2 }, {v1 , v3 }, {v1 , v4 }, {v2 , v3 }, {v2 , v4 }, {v3 , v4 }, orderly. NUM-
BER EDGES is 0.0002, 0.0002, 0.0002, 0.0002, 0.0002, 0.0002 for the sets
{v1 , v2 }, {v1 , v3 }, {v1 , v4 }, {v2 , v3 }, {v2 , v4 }, {v3 , v4 }, orderly. These leads us to
the upcoming result but it’s obvious.
There’s no result when we’re talking about the cardinality so if |S1 | ≤ |S2 |,
then there’s no results about the number order, number vertices, number size
and number edge but in the weakest condition when we’re talking about being
subset which implies |S1 | ≤ |S2 |, there’s obvious result. It’s the fact that
|S1 | ≤ |S2 | doesn’t imply S1 ⊆ S2 but S1 ⊆ S2 implies |S1 | ≤ |S2 |. Therefore,
there’s algebraic viewpoint to this abstract notion about the sets in the way
that, objects of sets have been assigned to numbers and numbers introduce new
definition and new results about sets. The notions of number order, number
vertices, number size and number edge are abstract and there’s no need to have
number graph to have them but there’s need to have them to have number
graphs. For any couple of set and its subset, the inequality of inclusion holds.
In other words, the number order, number vertices, number size and number
edge of greater sets is greater then its peer in its subset. Therefore,
R1 Proposition 2.0.7. If S1 ⊆ S2 , then

OS1 (N G) ≤ OS2 (N G), OS1 (N V) ≤ OS2 (N V),

SS1 (N G) ≤ SS2 (N G), SS1 (N E) ≤ SS2 (N E).

Corollary 2.0.8. Let N G = (N1 , N2 ) be a number graph on the graph G =

(V, E). Therefore,
(i) O(N G) ≥ O(N V);
(ii) S(N G) ≥ S(N E);
(iii) O(N G) ≥ S(N G);

6
 (iv) O(N V) ≥ S(N E);
(v) O(G) ≥ O(N G);
(vi) S(G) ≥ S(N G).

Proof. (i) and (ii) are obvious by proposition 2.0.7 but there are some points
about (iii). For any xy ∈ E, N2 (xy) ≤ N1 (x) ∧ N1 (y) ≤ N1 (x), N1 (y). It
implies summation on all edges, on the left hand and right hand of inequality,
gets the intended result.
(iv) is obvious by (iii).
(v) and (vi) are obvious when the number vertices and number of edges are
the same and equals to one. 

Exercises
1. For any collection of numbers, exemplify some number graphs.
2. For any collections of edges, how many different styles of number
graphs could be defined and what are they?
3. For any given graph, how many different styles of number graphs
could be defined and what are they?
4. For any number, how many different styles of number graph could
be obtained and what are they?
5. Change the definition by replacing lower than by greater than and
do Exercises 1-4 again.
6. Change the definition by replacing minimum than by maximum than
and do Exercises 1-4 again.
7. Get some results involving number order and number vertices.
8. For any given number, define the number graph from the number
which are prime in comparison to given number and calculate the
fundamental parameters of number graphs.
9. Get some classes of number graphs which have the formula for
fundamental parameters.

7
 CHAPTER 3

Types Of Number Subgraphs

??????
The kind of obtaining number graphs from a given number graph when the
number graph is obtained from a graph. It’s useful to use parameters unary
operations N1 and N2 in the forms of quality and inequality in comparison
to a given graph to introduce the NUMBER SPAN and NUMBER
SUBGRAPH but the letters as notations are Greek letters which are used
to define on the graph but in the process of obtaining new number graph, the
Greek letter is used for this kind of functions.

Definition 3.0.1 (NUMBER SPAN). Let N G = (N1 , N2 ) be a number graph.

The second style of graph which is obtained on it, is called NUMBER SPAN,
denoted by N S = (N3 , N4 ) and it’s restricted by the inequality and equality
N3 = N1 , N4 ⊆ N2 .

Possibilities amid two couple of functions or more precise amid two couple
of unary operations are when both go to equality which there’s no new number
graphs.Therefore, there three cases in that, one case is passed when the second
position goes to inequality where we’re talking about the number subgraphs
implies as jargons, being subsets and being equal. The general form is when
both go to inequality which has the word being subset of the basis number
graph.

Definition 3.0.2 (NUMBER SUBGRAPH). Let N G = (N1 , N2 ) be a

number graph. The second style of graph which is obtained on it, is called
NUMBER SUBGRAPH, denoted by N B = (N3 , ν) and it’s restricted by
the inequality and equality N1 ⊆ N3 , N4 ⊆ N2 .

This discussion is when the basis graph is fixed but it makes sense that
every graphs comes up with the notion about having different basis of graph,
having subset of vertex set, having subset of edge set or any possible connections
about them. To capture one example, a number graph could be defined by
the subset of vertex set in comparison to another graph or in different visions,
two number graphs with the differences about having vertex set and subset of
vertex set have been titled as NUMBER IMPLY which is too close to the
notion of NUMBER SUBGRAPH which is based on same vertex set. A
number graph has four parameters which two out of four are implied by its
basis which is graph and they’re vertex set and edge set but the next couple
are about the functions, two unary operations, which assign to any vertex and
edge, different numbers independently and the numbers are chosen from the

9
 3. Types Of Number Subgraphs

interval [0, 1]. The kind of making sense from numbers when the words have no
ways to go. How the degree of words could be possible in the terms of numbers
which are infinite but comparable.
Definition 3.0.3 (NUMBER IMPLY). Let N G = (N1 , N2 ) be a number
graph. The second style of graph which is obtained on it, is called NUMBER
IMPLY, denoted by N I = (N3 , ν) and it’s restricted by the inequality and
equality V (N I) ⊆ V (N G), N1 = N3 , ν = N2 .

Exercises
1. For any collection of numbers, exemplify some number subgraphs.
2. For any collections of edges, how many different styles of number
subgraphs could be defined and what are they?
3. For any given graph, how many different styles of number subgraphs
could be defined and what are they?
4. For any number, how many different styles of number subgraph could
be obtained and what are they?
5. Change the definitions of different styles of number subgraphs do
Exercises 1-4 again.
6. Change the definition of number graph by replacing minimum than
by maximum than and do Exercises 1-4 again.

10
 CHAPTER 4

Number Of The Vertices

??????
Definition 4.0.1 (PATH And Its NUMBER). Let N G = (N1 , N2 ) be a
number graph. The the minimum number of edges in consecutive vertices
v1 v2 · · · vn from v1 to vn with the length n which is called PATH, is called
NUMBER of path, denoted by N (P) where n ≥ 2.
Example 4.0.2. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. For the length two, all paths are v1 v2 v3 , v2 v3 v4 ,
v3 v4 v1 , v4 v1 v2 and there are only four paths from the length two. From v1 to
v3 , all paths are v1 v2 v3 and v3 v4 v1 and there are only two paths from any given
vertex to any given vertex. NUMBER of PATH is forever 0.0001. Therefore
N (P) = 0.0001 for any given path. The consecutive vertices v4 v3 v2 v1 is the
path from v4 to v1 with the length three and the NUMBER of PATH is 0.0001.
Definition 4.0.3 (Two Vertices And NUMBER). Let N G = (N1 , N2 ) be
a number graph. The maximum number of paths from v1 to vn is called
NUMBER of v1 and v2 , is denoted by N (v1 , vn ) where n ≥ 2.
Example 4.0.4. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. For the number of 0.0001, any couple of vertices
have this number. For the vertex v1 , any other given vertex have the same
number 0.0001 of couple of vertices. For any two vertices, number of them
is the same and is 0.0001. The number of v1 and v3 is 0.0001. Therefore
N (v1 , v3 ) = 0.0001.
The number of two vertices could find some connections when two vertices are
the endpoints of an edge. In this case, two numbers are comparable. Deleting
one edge or deleting one vertex is the matter of mind when there are two
vertices whose number is changed and it directs us to the notion of NUMBER
CUTVERTEX and NUMBER CUTEDGE. In the elementary case, when
one edge is deleted the number of its endpoints is changed which leads us
to the notion of NUMBER BRIDGE. Changes in the number graph via
deletion of vertex, edge and special edge could gives us new result to facilitate
understanding this kind of graph. To avoid confusion with the literature of
graph theory and in the matter convenient texts, there are efforts to use the
word number before any notion which is defined so usually the name of new
notion is twofolds which the first part is number. Therefore, there’s second
number graph is obtained from a number graph by deletion one edge or one
vertex whose parameters are denoted by notation with the power of 0 like
0 0 0 0 0
V , E , N G , N (P ), N (x, y) and etc.

11
4. Number Of The Vertices

Definition 4.0.5 (NUMBER BRIDGE). Let N G = (N1 , N2 ) be a number

0
graph. The edge xy is called NUMBER BRIDGE if N (x, y) > N (x, y).
Example 4.0.6. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. For the number of 0.0001, any edge is
NUMBER BRIDGE. Any edge is NUMBER BRIDGE. For any edge xy,
0
N (x, y) = N (x, y). None of edge is bridge but all of them are NUMBER
BRIDGE.
The notions of cutvertex, edgecut and bridge are used for the situation in
that, the deletion of vertex or edge increases the component of the graph but
they’ve different meanings in NUMBER GRAPH.
Definition 4.0.7 (NUMBER CUTVERTEX). Let N G = (N1 , N2 ) be a
number graph. The vertex x is called NUMBER CUTVERTEX if there
0
are two vertices x1 and y1 such that N (x1 , y1 ) > N (x1 , y1 ).
Example 4.0.8. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. For the number of 0.0001, any vertex is NUMBER
CUTVERTEX. Any vertex is NUMBER CUTVERTEX. For any given two
0
vertices xy, N (x, y) = N (x, y). None of edge is CUTVERTEX but all of them
are NUMBER CUTVERTEX.
The notion of NUMBER BRIDGE and NUMBER CUTEDGE are too
close to each other. If one edge is NUMBER BRIDGE, then it implies to be
NUMBER CUTEDGE but If one edge is NUMBER CUTEDGE, then it doesn’t
imply to be NUMBER BRIDGE.
Definition 4.0.9 (NUMBER CUTEDGE). Let N G = (N1 , N2 ) be a number
graph. The edge xy is called NUMBER CUTEDGE if there are two vertices
0
x1 and y1 such that N (x1 , y1 ) > N (x1 , y1 ).
Example 4.0.10. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. For the number of 0.0001, any edge is NUMBER
CUTEDGE. Any edge is NUMBER CUTEDGE. For any given edge xy,
0
N (x, y) = N (x, y). None of edge is CUTEDGE but all of them are NUMBER
CUTEDGE.
This discussion motivates us to bring this result.
Corollary 4.0.11. Let N G = (N1 , N2 ) be a number graph which all edges have
the same number. Then all vertices are NUMBER CUTVERTEX, NUMBER
CUTEDGE and NUMBER BRIDGE.
A cycle is path such that the first and last vertex is the same. In other
words, a sequence of at least three consecutive vertices which are distinct with
the exception of first vertex and last vertex which are forever the same. For
having cycle at least three distinct vertices are needed but for having path at
least two distinct vertices are needed. This discussion is about graph theory
but in the number graphs, the edges have values so the words, weakest and
strongest, make sense. For example, weakest edge in number graph, is the edge
with the minimum amount amid all edges of number graphs but the strongest
edge in number graph, is the edge with the maximum amount amid all edges
of number graphs. These discussions are exclusive to number graphs in the
way that, red boarders of this two field have been passed. The concept of

12
cycle and cycle graph are the same in graphs but the concept of cycle and
number cycle are different in graphs. The concept of path and number path
are the same in graphs and number graphs. The proof has an approach of
falsity of reverse in both sides because in the conditional statements, there’s an
equivalent statement so there’s use of negation of reverse statement. It means
0 0
P ⇒ Q is equivalent with Q ⇒ P but the statement P is equivalent with the
0 0 0 0
statement Q which implies proving Q ⇒ P and P ⇒ Q because accessibility
and convenient ways are our concern.
Theorem 4.0.12. Let N G = (N1 , N2 ) be a number graph. If an edge xy is
NUMBER BRIDGE then it’s NUMBER CUTEDGE.

Proof. Consider an edge xy isn’t NUMBER CUTEDGE so there are no couple

0
of vertices v, w such that N (v, w) ≥ N (v, w). It means for any couple of
0 0
vertices v, w, N (v, w) < N (v, w). Therefore, N (x, y) < N (x, y) implies xy
isn’t NUMBER BRIDGE. 

There are some points about the way in that, the consecutive vertices are
considered in the matter of having number of edges. The weakest edge and
strongest edge in a cycle of number graphs could go up to say something about
any cycle of number graphs. In a cycle there are only two paths amid any
two given points. Picture 1.1 depicts one cycle for any couple of vertices and
it’s cycle graph from the order four and it’s NUMBER CYCLE which is
restricted by having two weakest edges. Therefore,
Definition 4.0.13 (NUMBER CYCLE). Let N G = (N1 , N2 ) be a number
graph. A cycle of graph which is obtained on it, is called NUMBER CYCLE,
denoted by N C = (N1 , N2 ) and
V it’s restricted by there are x, y ∈ E such that
x 6= y but N2 (x) = N2 (y) = e∈E N2 (e).
Example 4.0.14. Picture 1.1 depicts the frame to make sense about some
definitions which have passed. All edges are the weakest edges in this number
graph. This number graph is number cycle from the order four and length
four for any given vertex of graph. For vertex v1 , there’s one number cycle
and for any given vertex, there’s one number cycle. The weakest amount is
0.0001. So for the amount 0.0001, there’s one number cycle which in that, this
amount is weakest edge for at least two edges. For every amount, there are two
edges which are the weakest edges on a cycle. So for every amount, there’s one
number cycle.
Theorem 4.0.15. Let N G = (N1 , N2 ) be a number graph on a cycle graph. If
every edge has same amount, then N G = (N1 , N2 ) is a number cycle which is
denoted by N C = (N1 , N2 ).
The word STRICT is used to delete the equality in the formulae which
it’s about. So strict NUMBER CUTEDGE means the equality amid numbers
no longer holds. Hence there’s proper inequality. The notion of NUMBER
CYCLE is the special case of cycle graph but it could be obtained in the number
graph as its NUMBER SUBGRAPH. The notion of cycle is in graph, is used
to get result for NUMBER GRAPH. The Proving of validity and credit about
following result could be done in the types of cycle result which comes up with
conditional statements. To prove (ii) ⇒ (i), (i) ⇒ (iii) and (iii) ⇒ (ii), there’s

13
 4. Number Of The Vertices

use of negation of intended result and obtaining contradiction with supposition

0 0
but it doesn’t mean P ⇒ Q is equivalent with Q ⇒ P . Therefore,
R2 Theorem 4.0.16. Let N G = (N1 , N2 ) be a number graph. Then the following
statements are equivalent:

(i) An edge xy is strict NUMBER CUTEDGE.

0
(ii) N2 (xy) > N (x, y)

(iii) An edge xy has no endpoints in any given cycle of number graph such
that it’s considered weakest edge on it.

Proof. (ii) ⇒ (i) An edge xy isn’t strict NUMBER CUTEDGE. Hence

0 0
N (x, y) ≥ N2 (xy) and N (x, y) = N (x, y) but it’s contradiction with
0
supposition N2 (xy) > N (x, y).
(i) ⇒ (iii) An edge xy is strict NUMBER CUTEDGE but it has its endpoints in
a cycle v1 v2 · · · xy · · · vn−1 vn v1 of graphs such that it’s considered weakest edge
on it. By using the path y · · · vn−1 vn v1 v2 · · · , x from y to x which its number
is strictly greater than the edge, it means N (x, y) ≥ N (P ) > N2 (yx) = N2 (xy)
but it implies N (x, y) > N2 (xy). Therefore, it’s contradiction with supposition
xy is strict NUMBER CUTEDGE.
0
(iii) ⇒ (ii) Consider N2 (xy) ≤ N (x, y). Hence there’s the path x, v1 , v2 · · · , y
from x to y which its number is greater than the edge, it means N (P ) ≥ N2 (xy),
and it doesn’t have the edge xy so this path with the edge xy have formed
a cycle which the edge xy has its endpoints in this cycle of number graph
such that it’s considered weakest edge on it. Therefore, It’s contradiction with
supposition. 

Corollary 4.0.17. Let N C = (N1 , N2 ) be a number cycle. Then its weakest

edges aren’t strict NUMBER CUTEDGE.

Proof. By using Theorem 4.0.16, it’s obvious. 

Results could be proved by direct approaches or using indirect approaches

like using the approaches of getting contradiction as P ⇒ Q, therefore using
0 0
Q and getting P which means contradictions with supposition. Or using the
negation of reverse results in the way that both sides are under negation to be
0 0
proved like P ⇒ Q but proving Q ⇒ P implies proving P ⇒ Q.
Example 4.0.18. Picture 1.1 depicts the edge v1 v2 is on a cycle v1 v4 v3 v2 v1 such
that it’s considered weakest edge on it. So by Theorem 4.0.16, this edge isn’t
strict NUMBER CUTEDGE. Any edges has the analogous to the case, so any
of edges isn’t strict NUMBER CUTEDGE. Any of weakest edge on any cycle
isn’t strict NUMBER CUTEDGE but any cycle only have weakest edges so all
edges aren’t strict NUMBER CUTEDGE.
Corollary 4.0.19. Let N C = (N1 , N2 ) be a number cycle. None of edges is
strict NUMBER CUTEDGE if and only if any of edges has the same amount.
Definition 4.0.20 (NUMBER BLOCK). Let N G = (N1 , N2 ) be a number
graph. The second style of graph which is obtained on it via deleting one vertex,
is called NUMBER BLOCK, denoted by N L = (N3 , ν) and it’s restricted
by having no number cutvertex.

14
Example 4.0.21. Picture 4.1 depicts that the vertex v4 is number cutvertex
but there’s no number cutedge. The only vertex v4 is number cutvertex but
any of other vertices isn’t number cutvertex. Any of edge isn’t cutedge. This
number graph isn’t number block. Therefore, this is N G but this isn’t any of
N L.

Figure 4.1: Graphs And Number Graphs NG2

Example 4.0.22. Picture 4.2 depicts that any of edge isn’t number cutedge and
any of vertex isn’t number cutvertex but this number graph is a number block
N L. Therefore, this is N G and N L.

Figure 4.2: Graphs And Number Graphs NG3

There are some senses about the connections amid cutvertex and cutedge.
Because if one edge is cutedge, then deletion of it changes the number amid
couple of vertices but deletion any of its endpoints remove this edge so if there’s
one cutedge, then there are two cutvertices.
Example 4.0.23. Picture 4.3 depicts that the edge v1 v2 is number cutedge and
the vertices v1 and v2 are number cutvertex. There are two number cutvertices
v1 and v2 and one number cutedge v1 v2 . The number cutedge is only v1 v2 but
this number graph isn’t a number block N L. Therefore, this is N G but it isn’t
N L.

Figure 4.3: Graphs And Number Graphs NG4

Theorem 4.0.24. Let N G = (N1 , N2 ) be a number graph. If there’s one cutedge,

then there are two cutvertices.

15
4. Number Of The Vertices

Corollary 4.0.25. Let N G = (N1 , N2 ) be a number graph. If there’s one cutedge,

then this number graph isn’t a number block N L. Therefore, this is N G but it
isn’t N L.
Corollary 4.0.26. Let N G = (N1 , N2 ) be a number graph. If between every two
vertices, there are two strongest paths with at least order of three, then this
number graph is a number block N L. Therefore, this is N G and it is N L.
The reverse of next result doesn’t hold.
Corollary 4.0.27. Let N G = (N1 , N2 ) be a number graph. If number graph is a
number block N L, then every two vertices lie on a common cycle.
The notions of cycle and number cycle get us new notions about using parallel
notions of graph theory. The notions of cycle, acyclic, forest and tree could be
assigned to number graphs but the parallel notions could go in the reverse ways.
One of this move about reverse ways of number notions in comparison to its
graph peers is forest and trees. Forest is an acyclic graph and the connected
forest is called tree but one of applications of NUMBER SPAN, N G, is used
to define NUMBER FOREST in number graphs. Therefore,
Definition 4.0.28 (NUMBER FOREST). Let N G = (N1 , N2 ) be a number
graph. The second style of forest which is obtained on it, is called NUMBER
FOREST, denoted by N F = (N1 , N2 ) and it’s restricted by having the number
span N G 1 = (N1 , ν) is forest with this attribute that, for any edge xy ∈ EG \EG1 ,
there’s one path in N G 1 which implies NN G 1 (x, y) > N2 (xy).
Example 4.0.29. Pictures 4.1 and 4.2 depict number graphs aren’t number
forest but picture 4.3 depicts a number graphs is number forest.
In the Picture 4.1, the edge v1 v4 has the property of NN G 1 (x, y) < N2 (xy)
so this number graph isn’t number forest. In the Picture 4.1, there are only two
edges v1 v4 and v4 v3 which have the property of NN G 1 (x, y) < N2 (xy) which is
in contradiction with the definition of number forest about having the property
of NN G 1 (x, y) < N2 (xy).
In the Picture 4.2, the edge v1 v2 has the property of NN G 1 (x, y) < N2 (xy)
so this number graph isn’t number forest. In the Picture 4.2, there are only two
edges v1 v2 and v3 v4 which have the property of NN G 1 (x, y) < N2 (xy) which is
in contradiction with the definition of number forest about having the property
of NN G 1 (x, y) < N2 (xy).
In the Picture 4.4, a number span with vertex set, {v1 , v2 , v3 }, has the
property of NN G 1 (v2 , v3 ) > N2 (v2 v3 ) for the edge v2 v3 so this number graph is
a number forest.

Figure 4.4: Graphs And Number Graphs NG5

16
 Definition 4.0.30 (NUMBER TREE). Let N G = (N1 , N2 ) be a number
forest. The second style of tree which is obtained on it, is called NUMBER
TREE, denoted by N T = (N1 , N2 ) and it’s restricted by having N G = (N1 , N2 )
as one component and being a number forest.
Finding NUMBER FOREST, N F = (N1 , N2 ), in number graph by using
the notion of cycles and the term smallest for number edge and the weakest for
path. Next result tells us how to get number span of number forest by deletion
all edges which have two attributes. Finding one special edge, finding all these
special edges and deleting all of them so the remaining of number graph is
number span which is related to number forest. Therefore the problem is about
the edge with two attributes: one is about being without any effects on the
number of its endpoints so the number of its endpoints is strictly greater than
the number of edge; two is about being on a cycle.
R3 Theorem 4.0.31. Let N G = (N1 , N2 ) be a number graph. N G is a number
forest, N F = (N1 , N2 ) if and only if in any cycle of N G, there is an edge xy
0
such that N2 (xy) < N (x, y).

Proof. (⇒) If C is a cycle and xy ∈ C, xy 6∈ N G 1 where N G 1 is number span

which is related to number forest N G = (N1 , N2 ), then by definition of a number
0
forest N2 (xy) < N (x, y) ≤ N (x, y).
(⇐) If xy belongs to a cycle, then we delete it. This process does on any of xy
which is on a cycle.


Using negation of previous result is useful to get new result. Previous result
tell us about the condition which is equivalence with number forest. So if
number graph isn’t number forest, there’s conditional statement but it isn’t
equivalence condition when we use the approach in that, the negation of result
proves the statement by contradiction.
R4 Corollary 4.0.32. Let N G = (N1 , N2 ) be a number graph. If there’s either no
strongest path or one strongest path amid any of two given vertices, then N G is
number forest.

Proof. Suppose, it isn’t. Then by Theorem 4.0.31, there’s a cycle C such that
0
for all edges xy belongs to it, N2 (xy) ≥ N (x, y). Thus xy is strongest path of
order two from x to y. Therefore, by selecting the edge xy as a weakest edge
of C, the remaining of cycle C is a strongest path from x to y which implies
contradiction. 

The couple of number forest and its number span behaves differently. some
cases, the number of edge doesn’t make sense but sometimes, having all vertices
of number forest makes sense about what believe by us. It’s natural way to ask
question about the converse of conditional statement which whenever it holds
and it doesn’t hold and so on.
Example 4.0.33. There are some points. First, the converse of conditional
statement from Corollary 4.0.32 doesn’t hold. Thus there’s no sense a number
forest only have one strongest path amid any of couple of vertices but there’s an
example which makes sense about number graph which is a number forest and
have multiple strongest path. Picture 4.5 depicts a number forest where vertex

17
4. Number Of The Vertices

edge set {v1 v3 , v2 v3 , v1 v4 } which it identified the number span of it. Then the
edge v2 v3 doesn’t belong to number span but there’s strongest path v2 v1 v3 in
number path, it means N (v1 v2 ) < N (v1 , v2 ) which it proves the span number
with edges {v1 v3 , v2 v3 , v1 v4 } is the number span N S N F which is used to
define number forest N F.
Thus there are some points to consider the edge v1 v2 and N (v1 , v2 ). Because
N G is number forest but there are couple of vertices v2 and v4 such that there
are two strongest paths v4 v1 v3 v2 and v4 v1 v2 . In other words, there are two
paths v4 v1 v3 v2 and v4 v1 v2 with the same number N (v1 , v4 ) = 0.003.

Figure 4.5: Graphs And Number Graphs NG6

The term strongest path is used to identify the path whether has the
number N (x, y) or not? if does, the path is called the strongest path amid the
couple of vertices if not, there’s no term, it’s a path amid that couple of vertices.
To clarify the word strongest path, there’s station to review the literature of
this book with jargons and buzzwords.
Example 4.0.34. Picture 4.5 depicts some cases for strongest paths. Consider
the couple of vertices, v1 and v2 , the strongest path is only v1 v2 with
N (v1 , v2 ) = 0.007 Let v1 and v3 be up. Strongest path is only v1 v2 with
N (v1 , v2 ) = 0.007. Picture 4.4 depicts some cases for strongest paths. Let v2
and v3 be up. Then strongest path is only v2 v1 v3 with N (v1 , v2 ) = 0.007 but
let v1 and v3 be up. Thus strongest path is only v1 v3 with N (v1 , v2 ) = 0.007.
Picture 4.3 depicts some cases for strongest paths. Let v1 and v3 be up.
Then strongest paths are v1 v2 v3 and v1 v4 v3 with N (v1 , v2 ) = 0.001 but let v1
and v2 be up thus strongest path is only v1 v2 with N (v1 , v2 ) = 0.007.
Pictures 4.1 and 4.2 aren’t N F but the independent study on the strongest
path could be possible. Let v1 and v3 be up. Then strongest path is only v1 v4 v3
with N (v1 , v2 ) = 0.007 but let v1 and v2 be up thus strongest path is only v1 v2
with N (v1 , v2 ) = 0.007.
The notion of having the number amid two vertices is going up to introduce
new result. The kind of relation amid the number forest which makes the
0
equality in number cutedge N2 (xy) ≥ N (x, y) to be in two parts the right
hand is belonging to the number span N S N F but left hand doesn’t when the
all possibilities of being inequality have done. There’s nice connection amid
number cutedge and number forest which all edges of its number span N S N F
are number cutedge. Approach of proof is about using the negation of result
and getting contradiction with supposition in the way that, N S N F with the

18
attribute of being forest and as its consequence, having no cycles have the key
role to get result in the second case.
Corollary 4.0.35. Let N F = (N1 , N2 ) be a number forest. Then all edges of
its number span N S N F are just number cutedge.

Proof. Suppose the result doesn’t hold. Then either there’s one number cutedge
isn’t in N S N F or there’s one edge is in N S N F and it isn’t number cutedge.
There are two cases for a given edge xy. It is number cutedge and it isn’t
in N S N F so N2 (xy) < NN S N F (x, y) ≤ NN F (x, y) which implies xy isn’t a
number cutedge which is contradiction. It is in N S N F but it isn’t a number
cutedge. Thus there’s a path P from x to y such that N (P ) > N2 (xy). N S N F
with the attribute of being forest and as its consequence, having no cycles imply
any of its edges xi yi don’t belong to N S N F . Thus the edges xi yi imply a path
Pi in N S N F such that N (Pi ) > N2 (xi yi ) ≥ N (xi yi ) ≥ N (xy). Therefore, for
edges xi yi , there’s a path in N S N F and as its consequences, there’s a cycle
in N S N F which implies contradiction because N S N F is forest and forest is
acyclic graph which means has no cycles. 

There are nice discussions about N S N F and N S N T . Because there’s no

sense that N F has to be forest but its N S N F has to be forest. With analogous
to it, N T makes sense about not being tree but N S N T has to be tree.
Example 4.0.36. A relation amid number tree and number cycle could get three
cases as example and one case as Theorem. For example with three vertices
and three edges in the shape of triangle and in the term of complete graph from
the order three, and in the notion of cycle graph from the order three could get
two examples in that, there’s number tree but there isn’t number cycle and in
other example there’s number cycle but there isn’t number tree.
When two edges out of three edges get the same numbers if the number is
maximum number, then there’s no two minimum edges thus the number graph
isn’t number cycle but it’s number tree. If the number is minimum number,
then there’s two minimum edges thus the number graph is number cycle but
there’s no number span which only covers number cutedge because there’s one
cutedge which implies having only two vertices but the amount of vertices are
three so there isn’t number span for this number graph which implies it isn’t
number tree.
To get more senses, Picture 4.6, is about the first case so it isn’t number
tree because there’s no number span, so there’s no kind of number graph which
covers all vertices and its edges are cutedge. But it’s a number cycle because
it’s a cycle graph and it has two edges v1 v3 and v2 v3 which have the minimum
amount which is 0.001. The edge v2 v1 is only cutedge and there’s no number
cutedge more but it isn’t enough to cover all vertices. Using another ways, by
Theorem 4.0.31, the equation doesn’t hold.
Picture 4.7, is about the second case, there’s one edge v2 v3 which has
minimum amount so this cycle from order three isn’t number cycle but
it has two number cutedge v1 v2 and v1 v3 thus all vertices are covered by
their endpoints. This number span N S N T has only two number cutedge
v1 v2 and v1 v3 . The only edge v2 v3 is out of N S N T but the equation
0.0007 = N (P = v2 v1 v3 ) > 0.0001N2 (v2 v3 ) holds. Therefore it’s number
tree.

19
4. Number Of The Vertices

Figure 4.6: Graphs And Number Graphs NG7

Figure 4.7: Graphs And Number Graphs NG8

Figure 4.8: Graphs And Number Graphs NG9

If there’s need to make number graph which isn’t number tree, then there’s
an approach to make cycle on its number span. Then N S N T isn’t tree but
If there’s need to make number graph which isn’t number cycle, then there’s
an approach to make only one minimum amount for edge on number graph.
Therefore,
Picture 4.8 depicts a number graph which is neither a number tree nor
number cycle. There’s one edge v2 v3 with minimum amount 0.0001 thus it
isn’t number cycle. In the other hands, the triangle v1 v4 v5 has no cutedge and
if they is added to N S N T , they make cycle in N S N T . Therefore, there’s no
number span N S N T . The edges v1 v2 and v1 v3 are only cutedge which could
be number span N S N T , for triangle v1 v2 v3 but it has a part from the number
graph. Two vertices v4 and v5 could be covered by any of number span but the
equation doesn’t hold because there’s no cutedge with endpoints of v4 and v5 ,
if they are added to number span and there’s no path in number span which is
strictly greater than their amounts and the equality is forever holds, if they are
put in out of a number span.
When the word number span is coming up, there are two number graphs
which have the relation of being number subgraph with each other. A number
graph and its number span are two number graphs when we’re talking about

20
number subgraph. Number span is characterized by the set of edges because it
has the vertex set which is the same with the number graph which it’s supposed
to be as its number subgraph. In the special case, these types of number span
N S N T and N S N F which are number span of number tree and number span of
number forest, have the case in that they couldn’t get E as their characteristics
which this attribute is great and it’s surprising. Because in some cases, E could
be a number span
but E couldn’t be a number span

N SN T

of number tree and couldn’t be a number span of

N SN F

of number forest. E is the precise abstract from the form of number span

N S = (N3 , N4 )

which it’s restricted by the inequality and equality

N1 = N3 , N4 ⊆ N2 .

Then there are some points to use and it makes sense to use the subset of E
instead of the mess of notations and words: it’s contraction. Therefore,
Corollary 4.0.37. E isn’t a span number N S N T and N S N F when there’s a
cycle with three same number of edges as its number subgraph.

Proof. There’s a cycle so it isn’t forest which it implies it isn’t number forest.
Therefore, it implies it isn’t number tree. 

Corollary 4.0.38. Let N G = (N1 , N2 ) be a number graph. N G is a number

tree, N T = (N1 , N2 ) if and only if in any cycle of N G, there is an edge xy
0
such that N2 (xy) < N (x, y).
Corollary 4.0.39. Let N G = (N1 , N2 ) be a number graph with one component.
If there’s either no strongest path or one strongest path amid any of two given
vertices, then N G is number tree, N T = (N1 , N2 ).
Corollary 4.0.40. Let N T = (N1 , N2 ) be a number tree. Then all edges of its
number span N S N T are just number cutedge.
In next statement, there are two conditional statements which create the
equivalency amid number tree and number cycle.
Theorem 4.0.41. Let N G = (N1 , N2 ) be a cycle. Then N G = (N1 , N2 ) is
number cycle if and only if N G = (N1 , N2 ) isn’t a number tree.

Proof. (⇒) Suppose it’s a number cycle. It implies there are two distinct edges
2 such that they’ve minimum amounts amid edges, N2 (x1 y1 ) =
x1 y1 and x2 yV
N2 (x2 y2 ) = {N2 (uv) | uv ∈ E}. If N S N T = (N1 , N3 ) is number span of
N G = (N1 , N2 ), then since N G = (N1 , N2 ) is cycle, there’s only one edge xy
which is belongs to N G but it doesn’t belong to N S N T . It implies having
the path P amid x and y in N S N T which its number is greater then number

21
 4. Number Of The Vertices

of edge xy, N2 (xy) < NN S N T (x, y) but it isn’t. Therefore, it implies it isn’t
number tree. In a cycle amid any of given couple of vertices, there are only
two paths if they’re endpoints of one edge, there’s one path from order two and
another path has different order.
(⇐) N G = (N1 , N2 ) is a cycle. It isn’t a number tree then for any xy of
N G, for any of number span N S = (N1 , N4 ), they’re are tree and N2 (xy) ≥
NN S N T (x, y) where N4 (xy) =V 0 but N2 (xy) 6= 0. Thus N4 (x1 y1 ) = N2 (x1 y1 )
for all x1 y1 6= xy. It implies {N2 (uv) | uv ∈ E} isn’t unique. Therefore, it’s
number cycle. For all edges of cycle there’s only one path and this path has the
edge which implies it has the number lower than the number of edge thus the
minimum number of edge isn’t unique. 

There are natural questions about notions when two notions are up. When
are these two notions are equal? Under which conditions? When does one
notion hold where another doesn’t hold and conversely. When do two notions
hold? When don’t two notions hold? When does one notion cover another
notion? For example, it’s a number tree and it isn’t tree. The term strongest
and weakest are the adjective to talk about how the number of notion amid all
is big. Thus weakest edge means the number of edge is the minimum number
amid all number of edges in a number graph. The strongest edge means the
number of edge is the maximum number amid all numbers of edges in a number
graph. In a number cycle, there are at least two weakest edges.
Corollary 4.0.42. Let N C = (N1 , N2 ) be a number cycle. Then all edges are
cutedge if they aren’t weakest edges.
A number cycle is a cycle but the cycle isn’t forever a number cycle. Thus
the supposition of being cycle graph gets the strongest situation instead of
number cycle. When we’re talking about number forest or number tree, we’re
talking about two number graphs. The number forest N F and its number span
N S N F . The number tree N T and its number span N S N T .
Theorem 4.0.43. Let N G = (N1 , N2 ) be a number graph. A vertex w is number
6 w such that w is on every
cutvertex if and only if there are two vertices x, y =
strongest path from x to y.

Proof. (⇒) Let vertex w be a number cutvertex. It implies there are two
0
vertices x and y such that N (x, y) ≥ N (x, y). The last inequality implies there
are two vertices x, y 6= w such that w is on every strongest path from x to y.
(⇐) Let w be a vertex. There are two vertices x, y 6= w such that w is on
every strongest path from x to y. Thus it implies there are two vertices x and
0
y such that N (x, y) ≥ N (x, y). Therefore, vertex w is number cutvertex. 

A cutedge and a cutvertex have the same result in a number graph with
this difference that in the first case, one edge is doer but in the second case,
one vertex is doer.
R5 Theorem 4.0.44. Let N G = (N1 , N2 ) be a number graph. An edge w is number
cutedge if and only if there are two vertices x, y such that w is on every strongest
path from x to y.

22
 Proof. (⇒) Let vertex w be a number cutedge. It implies there are two vertices
0
x and y such that N (x, y) ≥ N (x, y). The last inequality implies there are two
vertices x, y such that w is on every strongest path from x to y.
(⇐) Let w be an edge. There are two vertices x, y such that w is on every
strongest path from x to y. Thus it implies there are two vertices x and y such
0
that N (x, y) ≥ N (x, y). Therefore, edge w is number cutedge. 

A relation for cutvertex when it has the connection with cutedge. The
word strongest and strong are the comparison amid number of notions. So
the strongest path is the path from one vertex x to another vertex y which its
number is greater than number of all paths which are from one vertex x to
another vertex y. Strong edge of the path P is the edge which its number is
greater than the number of all edges which are on the path P . The weakest
edge of a cycle C is an edge which its number is greater than the number of all
edges which are on the cycle C.
R6 Theorem 4.0.45. Let N G = (N1 , N2 ) be a number graph. If a vertex w is
common vertex of at least two cutedge, then the vertex w is cutvertex.

Proof. Let xw and wy be two cutedge. Thus by Theorem 4.0.44, there exist
two vertices x1 and y1 such that xw is on every strongest path from x1 to y1 .
There are two cases for w.

• If w 6= x1 , y1 , then w is a cutvertex.

• Otherwise, w is either x1 then wy is on every strongest path from w to

y1 or y1 thus xw is on every strongest path from x1 to w. If w isn’t a
cutvertex, then amid two vertices x and y, there is at least one strongest
path from x to y which in its consecutive vertices don’t contain vertex w
and this path with the edges xw and wy make s cycle.
Then the cycle xwyvn vn−1 · · · v2 v1 x is obtained.
There are two cases.

– The path xwy isn’t a strongest path. It implies three cases.

∗ One is xw is the weakest edges of the cycle xwyvn vn−1 · · · v2 v1 x
which is contradiction with supposition which states xw is
cutedge.
∗ One is yw is the weakest edges of the cycle xwyvn vn−1 · · · v2 v1 x
which is contradiction with supposition which states yw is
cutedge.
∗ Both xw and yw are the weakest edges of the cycle
xwyvn vn−1 · · · v2 v1 x which is contradiction with supposition
which states xw and yw are cutedge.
– The path xwy is a strongest path. It implies N (x, y) = N2 (xw) ∧
N2 (wy). Since P is a strongest path from x to y, N (x, y) =
N2 (xw) ∧ N2 (wy) = N (P ). Thus the number of edges of P are
greater than mathcalN2 (xw) and N2 (wy) then they’re at least as
strong as N2 (xw) and N2 (wy). In other word, If the edge e belongs
to P , then N2 (e) ≥ N2 (xw), N2 (wy). It implies xw or wy or both
are the weakest edges of the cycle xwyvn vn−1 · · · v2 v1 x. Therefore,

23
4. Number Of The Vertices

it’s contradiction with with supposition which states xw and yw are

number cutedge.

There’s a natural question about the reverse of the conditional statement

in Theorem 4.0.45 which is about how the reverse doesn’t hold. The following
example gives us a number graph which has the attribute in that, the reverse
of the conditional statement in Theorem 4.0.45 doesn’t hold.
Example 4.0.46. Picture 4.9 depicts a number graph which shows that the
reverse of the conditional statement in Theorem 4.0.45, doesn’t hold. The
the edges v1 v3 and v2 v4 are only number cutedge but the vertex v3 is number
cutvertex. Thus v3 is a number cutvertex but it isn’t the common vertex of at
least two number cutedge which is in this case, the common vertex of only two
number cutedge v1 v3 and v2 v4 .
v3 is a number cutvertex because there are two vertices x and y such that
0
N (x, y) ≥ N (x, y). v3 is a number cutvertex for couple of vertices v1 , v4 , v1 , v2 ,
v3 , v4 , and v3 , v2 because
0
0.005 = N (v1 , v4 ) ≥ N (v1 , v4 ) = 0.001
0
0.005 = N (v1 , v2 ) ≥ N (v1 , v2 ) = 0.001
0
0.005 = N (v3 , v4 ) ≥ N (v3 , v4 ) = 0.001
0
0.005 = N (v3 , v2 ) ≥ N (v3 , v2 ) = 0.001
v1 v3 and v2 v4 are number cutedge because there are two vertices x and y
0
such that N (x, y) ≥ N (x, y). v1 v3 and v2 v4 are a number cutedge for couple
of vertices v1 v3 and v2 v4 , because
0
0.007 = N (v1 , v3 ) ≥ N (v1 , v3 ) = 0.001
0
0.007 = N (v2 , v4 ) ≥ N (v2 , v4 ) = 0.001
v1 v3 and v2 v4 are both number cutedge and number bridge because it reduce
the number of its endpoints as number of couple vertices.
v1 v3 is number bridge because there are two vertices x and y such that
0
0.007 = N (v1 , v3 ) ≥ N (v1 , v3 ) = 0.001.
v2 v4 is number bridge because there are two vertices x and y such that
0
0.007 = N (v2 , v4 ) ≥ N (v2 , v4 ) = 0.001

Figure 4.9: Graphs And Number Graphs NG10

Theorem 4.0.47. Let N G = (N1 , N2 ) be a number graph. If xy is a number

bridge, then N (x, y) = N2 (xy).

Proof. By using definition, it’s obvious that N (x, y) > N2 (xy). Thus there’s
one path P : xv1 v2 · · · vn y such that N (P ) = N (x, y) and N (P ) > N2 (xy).

24
 If vi vj is an edge of P : xv1 v2 · · · vn y, then N2 (vi vj ) > N2 (xy). It implies
xy is the weakest edge when it adds to path P : xv1 v2 · · · vn y, it forms
a cycle C : xv1 v2 · · · vn yx. Therefore xy is the weakest edge of cycle
0
C : xv1 v2 · · · vn yx which implies N (x, y) = N (x, y) but xy is number bridge
0
then N (x, y) = N (x, y) it’s contradiction with with supposition which states
xy is number bridge. 

R7 Corollary 4.0.48. Let N G 1 = (N3 , N4 ) be a number subgraph of N G =

(N1 , N2 ). Then for all vertices x and y, NN G 1 (x, y) ≤ NN G (x, y).
Definition 4.0.49 (NUMBER COMPLETE). Let N G = (N1 , N2 ) be a
number graph. The second style of complete graph which is obtained on
it, is called NUMBER COMPLETE, denoted by N M and it’s restricted
by the equality N2 (xy) = N1 (x) ∧ N1 (x) for all x and y.
R8 Corollary 4.0.50. Let N M = (N1 , N2 ) be a number complete. Thus

• For all vertices x, y, N (x, y) = N2 (xy).

• It has no number cutvertices.

Example 4.0.51. Picture 4.9 depicts a number graph which shows that the
reverse of the conditional statement in Corollary 4.0.50, doesn’t hold.
v3 is a number cutvertex because there are two vertices x and y such that
0
N (x, y) ≥ N (x, y). v3 is a number cutvertex for couple of vertices v1 , v4 , v1 , v2 ,
v3 , v4 , and v3 , v2 because
0
0.005 = N (v1 , v4 ) ≥ N (v1 , v4 ) = 0.001
0
0.005 = N (v1 , v2 ) ≥ N (v1 , v2 ) = 0.001
0
0.005 = N (v3 , v4 ) ≥ N (v3 , v4 ) = 0.001
0
0.005 = N (v3 , v2 ) ≥ N (v3 , v2 ) = 0.001
But number graph isn’t number complete because
0.0001 = N2 (v1 v2 ) 6= N1 (v1 ) ∧ N1 (v2 ) = 0.01 ∧ 0.02 = 0.01
0.0007 = N2 (v1 v3 ) 6= N1 (v1 ) ∧ N1 (v3 ) = 0.01 ∧ 0.03 = 0.01
0.0001 = N2 (v1 v4 ) 6= N1 (v1 ) ∧ N1 (v4 ) = 0.01 ∧ 0.04 = 0.01
0.0005 = N2 (v2 v3 ) 6= N1 (v2 ) ∧ N1 (v3 ) = 0.02 ∧ 0.03 = 0.02
0.0007 = N2 (v2 v4 ) 6= N1 (v2 ) ∧ N1 (v4 ) = 0.02 ∧ 0.04 = 0.02
0.0005 = N2 (v3 v4 ) 6= N1 (v3 ) ∧ N1 (v4 ) = 0.03 ∧ 0.04 = 0.03
v1 v3 and v2 v4 are number cutedge because there are two vertices x and y
0
such that N (x, y) ≥ N (x, y). v1 v3 and v2 v4 are a number cutedge for couple
of vertices v1 v3 and v2 v4 , because
0
0.007 = N (v1 , v3 ) ≥ N (v1 , v3 ) = 0.001
0
0.007 = N (v2 , v4 ) ≥ N (v2 , v4 ) = 0.001
v1 v3 and v2 v4 are both number cutedge and number bridge because it reduce
the number of its endpoints as number of couple vertices.
v1 v3 is number bridge because there are two vertices x and y such that
0
0.007 = N (v1 , v3 ) ≥ N (v1 , v3 ) = 0.001.
v2 v4 is number bridge because there are two vertices x and y such that
0
0.007 = N (v2 , v4 ) ≥ N (v2 , v4 ) = 0.001
The negation of result or condition proves the statement by contradiction.

25
4. Number Of The Vertices

Theorem 4.0.52. Let N T = (N1 , N2 ) be a number tree. Then G isn’t complete

number.

Proof. Let N T = (N1 , N2 ) be a complete number N M = (N1 , N2 ). By

Corollary 4.0.50, for all vertices x, y, N (x, y) = N2 (xy) but by definition of
number tree, NN S N T (xy) > N2 (xy). Therefore, NN T (x, y) < NN S N T (x, y) is
contradiction by Corollary 4.0.48. 

The term of end vertex could be the point amid number graph and its
number subgraph. The well-known number graph and its number subgraph
which are related to each other are N S N T and N T or N S N F and N F. Internal
vertices of N S N T make graph to be two parts, end vertices and internal vertices.

Theorem 4.0.53. Let N T = (N1 , N2 ) be a number tree. Then the internal

vertices of N S N T are the number cutvertices of N T = (N1 , N2 ).

Proof. There are two cases.

• Let w be a vertex of N T such that w isn’t an end vertex of N S N T . Thus
w is common vertex of at least two cutedge in N S N T which imply w is a
cutvertex by Theorem 4.0.45.
• Let w be an end vertex of N T such that w is a vertex of N S N T . Thus
there are x, y 6= w such that w is on every strongest x − y path in N S N T
if it’s number cutvertex but it’s end vertex.

A relation amid cutvertex and cutedge in the number tree could make open
way to have same notions.
Corollary 4.0.54. Let N T = (N1 , N2 ) be a number tree. Thus a cutvertex is
the common vertex of at least two number cutedge.
The equivalent condition for number tree is obtained.
Theorem 4.0.55. Let N G = (N1 , N2 ) be a number graph. For all edge xy,
NN T (x, y) = N2 (xy) implies xy is a number cutedge and conversely if and only
if N T = (N1 , N2 ) is a number tree.

Proof. (⇐) Let N T = (N1 , N2 ) be a number tree.

If xy is number cutedge, then NN T (x, y) = N2 (xy).
If xy be an edge such that NN T (x, y) = N2 (xy), then there are two cases;
if N G = (N1 , N2 ) is tree graph, then xy is number cutedge;
Otherwise, xy is in N S N T . Thus number cutedge.
(⇒) 

26