1000 resultados para Anti-Gallai graphs
Resumo:
The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.
Resumo:
This study examines how children make sense of “anti-oppressive” children’s literature in the classroom, specifically, books that integrate and promote positive portrayals of gender non-conformity and sexual diversity. Through a feminist poststructural lens, I conducted ethnographic observations and reading groups with twenty students in a grade one/two classroom to explore how children engage with these storybooks. I further explored how the use of these books in the classroom might help to mediate and negotiate existing gendered and heteronormative beliefs and practices within educational settings. The books used in this study challenge oppressive gender and sexuality regimes within mainstream children’s literature that have traditionally served to marginalize and silence gender non-conforming and LGBTQ individuals. Responses from participants in this study aid in questioning how dominant discourses of gender and sexuality are produced and reinforced, as well as where we may find opportunities for change and reform within the elementary school classroom.
Resumo:
Consider an undirected graph G and a subgraph of G, H. A q-backbone k-colouring of (G,H) is a mapping f: V(G) {1, 2, ..., k} such that G is properly coloured and for each edge of H, the colours of its endpoints differ by at least q. The minimum number k for which there is a backbone k-colouring of (G,H) is the backbone chromatic number, BBCq(G,H). It has been proved that backbone k-colouring of (G,T) is at most 4 if G is a connected C4-free planar graph or non-bipartite C5-free planar graph or Cj-free, j∈{6,7,8} planar graph without adjacent triangles. In this thesis we improve the results mentioned above and prove that 2-backbone k-colouring of any connected planar graphs without adjacent triangles is at most 4 by using a discharging method. In the second part of this thesis we further improve these results by proving that for any graph G with χ(G) ≥ 4, BBC(G,T) = χ(G). In fact, we prove the stronger result that a backbone tree T in G exists, such that ∀ uv ∈ T, |f(u)-f(v)|=2 or |f(u)-f(v)| ≥ k-2, k = χ(G). For the case that G is a planar graph, according to Four Colour Theorem, χ(G) = 4; so, BBC(G,T) = 4.
Resumo:
In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.
Resumo:
Diagrams (charts and graphs) made into a booklet with a newspaper cover. This booklet contains cross sections of the back ditch on the south side of the Welland Canal feeder, west of the Marshville culverts (45 pages, hand drawn). This was created by Fred Holmes, Oct. 3, 1857.
Resumo:
Charts and graphs of cross sections from Brown’s ditch culvert to the main drain, cross sections from the feeder on the road allowance between lots 26 and 27 in the 5th concession of Humberstone, Cross sections of the main drain from Lyons Creek culvert to the road allowance between lots 7 and 8 in Wainfleet and cross selections of the old ditch on the west side of the road allowance between lots 17 and 18 in the 3rd concession in Wainfleet (8 pages, hand drawn), n.d.
Resumo:
Tesis (Maestría en Ciencias con Especialidad en Inmunología) UANL
Resumo:
Tesis (Maestría en Ciencias con Especialidad en Inmunología) UANL
Resumo:
Tesis (Maestría en Ciencias, con especialidad en Inmunología) U.A.N.L.
Resumo:
Tesis (Maestría en Ciencias, con especialidad en Biología de la Reproducción) U.A.N.L.
Efecto anti-inflamatorio del clorhidrato de minociclina-gel en pacientes con enfermedad periodontal.
Resumo:
Tesis (Maestría en Odontología Avanzada) UANL, 2014.
Resumo:
UANL
Resumo:
UANL
Resumo:
UANL
Resumo:
UANL