{"id":{"repo_id":"wvu","oai_identifier":"oai:researchrepository.wvu.edu:etd-2370"},"canonical_url":"https://search.dev.ndltd.org/etd/wvu/oai:researchrepository.wvu.edu:etd-2370","repository":{"repo_id":"wvu","name":"West Virginia University","base_url":"https://researchrepository.wvu.edu/do/oai/"},"display":{"title":"Generalized nowhere zero flow","abstract":"Let G be 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 from v, equals b( v). An A-nowhere-zero-flow (abbreviated as A-NZF) in G is a function f : E(G) A* such that at each vertex v ∈ V(G), ∂f(v) = 0.;In this paper, we investigate the group connectivity number Lambda g(G) = min{lcub}n : if A is an abelian group with |A| ≥ n, then G is A-connected{rcub} for certain families of graphs including complete bipartite graphs, chordal graphs, wheels and biwheels. We also give some general results and methods to approach nowhere zero flow and group connectivity problems.","abstract_html":"Let G be 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 from v, equals b( v). An A-nowhere-zero-flow (abbreviated as A-NZF) in G is a function f : E(G) A* such that at each vertex v ∈ V(G), ∂f(v) = 0.;In this paper, we investigate the group connectivity number Lambda g(G) = min{lcub}n : if A is an abelian group with |A| ≥ n, then G is A-connected{rcub} for certain families of graphs including complete bipartite graphs, chordal graphs, wheels and biwheels. We also give some general results and methods to approach nowhere zero flow and group connectivity problems.","abstract_has_math":false,"creators":["Chen, Jingjing"],"institution":null,"degree_name":"MS","degree_level":"Thesis","degree_discipline":"Lane Department of Computer Science and Electrical Engineering","degree_department":null,"school":null,"contributors":["Elaine M. Eschen."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2003,"date_issued":"2003-12-01T08:00:00Z","date_published":"2003-12-01T08:00:00Z","updated_at":"2026-07-24T06:15:40Z","subjects":["Computer science","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://researchrepository.wvu.edu/etd/1367"],"render_values":[{"text":"https://researchrepository.wvu.edu/etd/1367","href":"https://researchrepository.wvu.edu/etd/1367","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.33915/etd.1367","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Elaine M. Eschen."]},{"key":"dc:creator","label":"Author","values":["Chen, Jingjing"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-01-17T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Lane Department of Computer Science and Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://doi.org/10.33915/etd.1367","https://researchrepository.wvu.edu/etd/1367"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Let G be 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 from v, equals b( v). An A-nowhere-zero-flow (abbreviated as A-NZF) in G is a function f : E(G) A* such that at each vertex v ∈ V(G), ∂f(v) = 0.;In this paper, we investigate the group connectivity number Lambda g(G) = min{lcub}n : if A is an abelian group with |A| ≥ n, then G is A-connected{rcub} for certain families of graphs including complete bipartite graphs, chordal graphs, wheels and biwheels. We also give some general results and methods to approach nowhere zero flow and group connectivity problems."]},{"key":"dc:title","label":"Title","values":["Generalized nowhere zero flow"]}]}],"canonical_facts":{"dc:contributor":["Elaine M. Eschen."],"dc:creator":["Chen, Jingjing"],"dc:date.available":["2019-01-17T08:00:00Z"],"dc:description.abstract":["Let G be 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 from v, equals b( v). An A-nowhere-zero-flow (abbreviated as A-NZF) in G is a function f : E(G) A* such that at each vertex v ∈ V(G), ∂f(v) = 0.;In this paper, we investigate the group connectivity number Lambda g(G) = min{lcub}n : if A is an abelian group with |A| ≥ n, then G is A-connected{rcub} for certain families of graphs including complete bipartite graphs, chordal graphs, wheels and biwheels. We also give some general results and methods to approach nowhere zero flow and group connectivity problems."],"dc:identifier":["https://doi.org/10.33915/etd.1367","https://researchrepository.wvu.edu/etd/1367"],"dc:subject":["Computer science","Mathematics"],"dc:title":["Generalized nowhere zero flow"],"thesis:degree_discipline":["Lane Department of Computer Science and Electrical Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["MS"]},"updated_at":"2026-07-24T06:15:40Z"}