Some Number and Graph th eo ry
The incidence chromatic number of some graph
... chromatic number for complete k-partite ...chromatic number of complete k-partite graphs, and also give the incidence chromatic number of three infinite families of ...
Some remarks on the geodetic number of a graph
... there are two vertices u 1 and u 2 in U such that their unique neighbours in V 1 are distinct. If u ∈ U \ {u 1 , u 2 } and u 0 is the unique neighbour of u in V 1 , then u 0 is non-adjacent either to u 1 or to u 2 and u ...
11
SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH
... undirected graph G = (V (G), E(G)) with vertex set V (G) and edge set ...the graph elements. A coloring of a graph G is to assign colors (numbers) to the vertices or edges or ...
5
Some bounds for the signed edge domination number of a graph
... The closed neighbourhood N G [ e] of an edge e in a graph G is the set consisting of e and of all edges having a common end vertex with e. Let f be a function on the edges of G into the set {−1, 1}. If e∈N G [x] ...
7
RELATION BETWEEN CHROMATIC, DOMINATOR, DOMINATOR CHROMATIC NUMBER OF MIDDLE GRAPH OF SOME SPECIAL GRAPH
... of graph theoretic parameters we have taken the parameters domination number, chromatic number and domination coloring number, for our ...domination number, chromatic number and ...
8
A Graph Technique to Determine the Minimum Number of Wavelength for some WDM Optical Networks
... Let E be the set of edge and * be the binary operating defined on E is a combination of edge in E such that resultant element is light path and F = (E,*) be the light path between the vertices to apply the coloring ...
5
The damage number of a graph
... damage number of a graph, which is the minimum number of distinct vertices the robbers can visit without ...cop number cops, where capture is not ...damage number is bounded by the ...
16
On the Number of Cycles in a Graph
... The number of n-cycles ( n = 3, 4, 5, 6) in a graph G is equal to 2 1 n ( tr A ( ) n − x ) where x is the number of closed walks of length n, which are not ...gave number of 7-cyclic graphs. ...
29
Regular number of line block graph of a graph
... subsets into which the edge set of Lb( ) should be partitioned so that the subgraph induced by each subset is regular and is denoted by ( ). In this paper some results on expressed in terms of elements of . ...
6
Regular Number of Semitotal block graph of a graph
... the number of vertices and edges of a graph G and the maximum degree of a vertex in G is denoted by ∆ G ...A graph G is called trivial if it has no ...independence number 𝛽 1 ∗ (G) is the ...
9
Product Cordial Graph in the Context of Some Graph Operations on Gear Graph
... A graph G = ( V G ( ) ( ) , E G ) is said to be a product cordial graph if there exists a function f V G : ( ) { } → 0 ,1 with each edge uv assign the label f u f v ( ) ( ) , such that the number of ...
9
Recurrence Relation for Achromatic Number of Line Graph of Graph
... © 2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 2785 Look at y. There is one orange colour edge yb and one red color edge yw. (This has become possible to get two different colour ...
6
Some graph parameters on the composite order Cayley graph
... Cayley graph is similar to the composite order Cayley graph, but note that these two graphs are completely different as the set S ...are some parame- ters for a graph, that can not achieve by ...
8
Some Graph Polynomials of the Power Graph and its Supergraphs
... simple graph with edge set E(Γ), and vertex set V ...the number of vertices of Γ. A set of vertices in a graph such that no two of them are adjacent, is called an independent ...the graph Γ, a ...
10
Some Cordial Labeling of Duplicate Graph of Ladder Graph
... the number of vertices labeled ‘0’ and the number of vertices labeled ‘1’ differ by at most “one” and (ii) the number of edges labeled ‘0’ and the number of edges labeled ‘1’ differ by at most ...
8
On the representation number of a crown graph
... Otherwise, some P i I i must contain at least two 1s. Without loss of generality, i = 1 (otherwise, we can apply a cyclic shift and rename the permutations). By Claim 1 applied to P 1 and P 1 I 1 P 2 , at least ...
11
The detour hull number of a graph
... connected graph G with r detour extreme vertices, each of degree ...hull number and the detour number respectively, of some ...connected graph of order n, detour diameter D and detour ...
16
The number of spanning trees of a graph
... complete graph K n . In this paper we obtain some upper bounds on the number of spanning trees of graph G in terms of its structural parameters such as the number of vertices (n), the ...
13
The hull number of an oriented graph
... oriented graph D constructed there has order n, diameter d = n − k + 1, and hull number k = n − d + ...hull number to geodetic ...oriented graph with h(D) = a and g(D) = b, then necessarily 2 ...
11
The number of spanning trees of a graph
... present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum ...
5