Results 11 to 20 of about 258,952 (290)
The set chromatic numbers of the middle graph of graphs [PDF]
Journal of Physics: Conference Series, 2021 AbstractFor a simple connected graphG, letc:V(G) → ℕ be a vertex coloring ofG,where adjacent vertices may be colored the same. The neighborhood color set of a vertexv, denoted byNC(v), is the set of colors of the neighbors ofv. The coloringcis called aset coloringprovided thatNC(u) ≠NC(v) for every pair of adjacent verticesuandvofG.
G R J Eugenio +2 more
openaire +3 more sources
Radio number for middle graph of paths [PDF]
Electronic Notes in Discrete Mathematics, 2017 8 Pages, CTGTC 2016 conference proceedings ...
Devsi Bantva
exaly +3 more sources
Vulnerability: integrity of a middle graph [PDF]
, 2008 A communication network can be considered to be highly vulnerable to disruption if the destruction of a few elements can result in no member's being able to communicate with very many others. This idea suggests the concept of the integrity of a graph.
Aysun Ataç, Şebnem Çelik
openaire +4 more sources
Graph Equations for Line Graphs, Jump Graphs, Middle Graphs, Splitting Graphs And Line Splitting Graphs [PDF]
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +3 more sources
Zeta functions and complexities of middle graphs of semiregular bipartite graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
The Middle Equitable Dominating Graphs [PDF]
Open Journal of Discrete Mathematics, 2012 Let G= (V, E) be a graph and A(G) is the collection of all minimal equitable dominating set of G. The middle equitable dominating graph of G is the graph denoted by Med(G) with vertex set the disjoint union of V∪A(G) and (u, v) is an edge if and only if u ∩ v ≠ φ whenever u, v ∈ A(G) or u ∈ v whenever u ∈ v and v ∈ A(G) .
Alwardi, Anwar +2 more
openaire +3 more sources
The middle graph of a hypergraph by [PDF]
, 1990 This paragraph is meant to present some definitions that are necessary to follow the further notes, our graph theoretic terminology being fairly standard [2], [3], as well the matroid terminology [5].
Marcu, Dănut
openaire +3 more sources
On the D-differential of a graph
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj +1 more source
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source