Dissertation > Excellent graduate degree dissertation topics show

A Minor Problem on Roman Domination in a Tree

Author: YinWei
Tutor: SongXiaoXin
School: Henan University
Course: Applied Mathematics
Keywords: Roman control
CLC: O157.5
Type: Master's thesis
Year: 2009
Downloads: 5
Quote: 0
Read: Download Dissertation

Abstract


Defined in V on a real function f: V - > {0,1,2} called graph G = (V, E) of a Roman control function, if V < sub > 0 < / sub > every vertex at least and V < sub > 2 < / sub > one of the adjacent vertices, which for I = 0,1,2, V < sub > I < / sub > = {u: f (u) = I} is V in the assignment for I vertices. For V any subset S, we define f (S) = ∑ < sub > V ∈ S < / sub > f (V), and we define the right f for ω (f) = ∑ < sub > V ∈ V < / sub > f (V). Graph G Roman control function of the minimum power called Rome control number, recorded as < sub > γ R < / sub > (G). If T is a tree and | | V (T) was 2, then < sub > γ R < / sub > (T) = gamma (T), 1 if and only if T is a morbid spider trees. In this paper we mainly study meet < sub > γ R < / sub > (T) = gamma (T) 2 and B (T) ∩ C (T) indicates a (?) Tree T structural properties.

Related Dissertations

  1. Weak Roman Domination in a 3×n Grid Graph,O157.5
  2. Weak Roman Domination in 4*n Grid Graph,O157.5
  3. Weak Roman Domination in Graphs and Six Security Levels,O157.5
  4. On Ohba’s Conjecture of One Class of Complete Multipartite Graphs,O157.5
  5. Analysis of Complex Networks Modeling and Its Application,O157.5
  6. About two parameters characteristic polynomial and its applications,O157.5
  7. Several studies for scheduling problem,O157.5
  8. Multi-attribute undirected weighted graph clustering method,O157.5
  9. The composite equilibrium existence of the network and its algorithm,O157.5
  10. Random Network Model Discrimination,O157.5
  11. Chromatic Equivalent Graphs of Two Kinds of Graphs,O157.5
  12. The General Methods of Studying the Spectra of Graph,O157.5
  13. The Supply Chain Modeling and Network Efficiency Research Based on Complex Network,O157.5
  14. Complex network reliability evaluation research,O157.5
  15. M (?) Bius cubes crossing number of graphs,O157.5
  16. Local tolerance studies twisted cube LTQ_n,O157.5
  17. Augmented Cubes AQn graph the number of crossing boundaries,O157.5
  18. Tolerant crossedcube study Pancyclicity,O157.5
  19. Local twisted cube graph crossing number of,O157.5
  20. Attack directed repair complex network invulnerability Strategy,O157.5
  21. Hopf Bifurcation and Generalized Synchronization of the Delayed Coupled Lorenz-Rossler Systems,O157.5

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory
© 2012 www.DissertationTopic.Net  Mobile