Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"Group Connectivity"”.

  1. Group Connectivity of Graphs

    … if G has a nowhere-zero A-flow, for any Abelian group A with |A| ≥ k. In 1992 Jaeger et al. [16] extended nowhere-zero flows to group connectivity of graphs: given an orientation D of a graph G, if for any b: V (G) A with sumv∈ V(G ) b(v) = 0, there always exists a map ƒ: E(G) A - {lcub}0{rcub}, …

    wvu Repository record for Group Connectivity of Graphs (opens in a new tab)

  2. Graph Coloring Problems and Group Connectivity

    1. Group connectivity. Let A be an abelian group and let iA(G) be the smallest positive integer m such that Lm(G) is A-connected. A path P of G is a normal divalent path if all internal vertices of P are of degree 2 in G and if |E(P)|= 2, then P is not in a 3-cycle of G. Let l(G) = max{lcub}m : G …

    wvu Repository record for Graph Coloring Problems and Group Connectivity (opens in a new tab)

  3. Group Connectivity and Modulo Orientations of Graphs

    … is Z3-connected. Consequently, Jaeger et al.'s group connectivity conjecture and Tutte's 3-Flow Conjecture hold for 5-edge-connected essentially 23-edge-connected graphs. We also provide several equivalent versions of Jaeger et al.'s group connectivity conjecture and indicate that it is enough …

    wvu Repository record for Group Connectivity and Modulo Orientations of Graphs (opens in a new tab)

  4. Generalized nowhere zero flow

    … an undirected graph, A be an (additive) abelian group and A* = A - {lcub}0{rcub}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V(G ) A satisfying Sv∈VG b(v) = 0, there is a function f : E(G) A* such that at each vertex v ∈ V(G), ∂f(v), the net flow out …

    wvu Repository record for Generalized nowhere zero flow (opens in a new tab)

  5. On flows of graphs

    … stronger results on this conjecture in terms of group connectivity and get the complete characterization of such graphs in those families which do not admit nowhere-zero 3-flows. For the circular flows of graphs, we establish some sufficient conditions for a graph to have circular flow index less …

    wvu Repository record for On flows of graphs (opens in a new tab)

  6. Group Colorability and Hamiltonian Properties of Graphs

    … edge-pancyclic, or pan-connected.;The problem of group colorings of graphs is also investigated in this dissertation. Group coloring was first introduced by Jeager et al. [21]. They introduced a concept of group connectivity as a generalization of nowhere-zero flows. They also introduced group …

    wvu Repository record for Group Colorability and Hamiltonian Properties of Graphs (opens in a new tab)

  7. The Digitally Born Identity: The Influence of Social Networking Sites on Teen Identity

    … as MySpace and Facebook, facilitate a social connectivity that influences how teens portray themselves online. The process of constructing a self-presentation, receiving input from peers, and then modifying one's self-presentation in response is not new, but the speed at which it occurs and …

    denver Repository record for The Digitally Born Identity: The Influence of Social Networking Sites on Teen Identity (opens in a new tab)

  8. Exploiting Structural Properties in the Analysis of High-dimensional Dynamical Systems

    … networked systems with multiple weakly-connected groups. Such a multi-cluster structure leads to a time-scale separation between the fast intra-group interaction due to high intra-group connectivity, and the slow inter-group oscillation, due to the weak inter-group connection. We develop a novel …

    jhu Repository record for Exploiting Structural Properties in the Analysis of High-dimensional Dynamical Systems (opens in a new tab)

  9. Development of a Group Dynamic Functional Connectivity Pipeline for Magnetoencephalography Data and its Application to the Human Face Processing Network

    … Recently, interest has turned to the analysis of connectivity between neural sources in dynamic brain networks. This new interest calls for the development of appropriate investigative techniques. A problem occurs in connectivity studies when the differing networks of individually analyzed …

    unm Repository record for Development of a Group Dynamic Functional Connectivity Pipeline for Magnetoencephalography Data and its Application to the Human Face Processing Network (opens in a new tab)

  10. A Functional Magnetic Resonance Imaging Study Evaluating the Effects of Intranasal Insulin on Food Related Reward and Appetite

    … probed the effects of insulin on resting state connectivity, resting state cerebral perfusion and the cerebral reward response to a food administration paradigm. This study was conducted in a group of healthy, male individuals, with normal and overweight participants. A drug delivery device …

    kings Repository record for A Functional Magnetic Resonance Imaging Study Evaluating the Effects of Intranasal Insulin on Food Related Reward and Appetite (opens in a new tab) Download PDF for A Functional Magnetic Resonance Imaging Study Evaluating the Effects of Intranasal Insulin on Food Related Reward and Appetite (opens in a new tab)

  11. Socio-behavioral implications of sterilization: Investigating changes in social dynamics of free-ranging long-tailed macaques (Macaca fascicularis) under fertility control

    … females, and on the social dynamics of two groups of macaques. This thesis aims to address the following three main questions: (1) Does infant presence influence the mother’s social position within the social group, and conversely, does the permanent absence of infant negatively impact the …

    liege Repository record for Socio-behavioral implications of sterilization: Investigating changes in social dynamics of free-ranging long-tailed macaques (Macaca fascicularis) under fertility control (opens in a new tab) Restricted access

  12. Weighted Modulo Orientations of Graphs

    … we reduced the Esperet et al's edge-connectivity lower bound for some (signed) graphs families including planar graphs, complete graphs, chordal graphs, series-parallel graphs and bipartite graphs, indicating that much lower edge-connectivity bound still guarantees the existence of …

    wvu Repository record for Weighted Modulo Orientations of Graphs (opens in a new tab)