7 research outputs found
Nowhere-Zero 3-Flows in Signed Graphs
Tutte observed that every nowhere-zero -flow on a plane graph gives rise to a -vertex-coloring of its dual, and vice versa. Thus nowhere-zero integer flow and graph coloring can be viewed as dual concepts. Jaeger further shows that if a graph has a face--colorable 2-cell embedding in some orientable surface, then it has a nowhere-zero -flow. However, if the surface is nonorientable, then a face--coloring corresponds to a nowhere-zero -flow in a signed graph arising from . Graphs embedded in orientable surfaces are therefore a special case that the corresponding signs are all positive. In this paper, we prove that if an 8-edge-connected signed graph admits a nowhere-zero integer flow, then it has a nowhere-zero 3-flow. Our result extends Thomassen's 3-flow theorem on 8-edge-connected graphs to the family of all 8-edge-connected signed graphs. And it also improves Zhu's 3-flow theorem on 11-edge-connected signed graphs.published_or_final_versio
Nowhere-Zero 3-Flows in Signed Graphs
Tutte observed that every nowhere-zero -flow on a plane graph gives rise to a -vertex-coloring of its dual, and vice versa. Thus nowhere-zero integer flow and graph coloring can be viewed as dual concepts. Jaeger further shows that if a graph has a face--colorable 2-cell embedding in some orientable surface, then it has a nowhere-zero -flow. However, if the surface is nonorientable, then a face--coloring corresponds to a nowhere-zero -flow in a signed graph arising from . Graphs embedded in orientable surfaces are therefore a special case that the corresponding signs are all positive. In this paper, we prove that if an 8-edge-connected signed graph admits a nowhere-zero integer flow, then it has a nowhere-zero 3-flow. Our result extends Thomassen\u27s 3-flow theorem on 8-edge-connected graphs to the family of all 8-edge-connected signed graphs. And it also improves Zhu\u27s 3-flow theorem on 11-edge-connected signed graphs
An 8-flow theorem for signed graphs
We prove that a signed graph admits a nowhere-zero -flow provided that it
is flow-admissible and the underlying graph admits a nowhere-zero -flow.
When combined with the 4-color theorem, this implies that every flow-admissible
bridgeless planar signed graph admits a nowhere-zero -flow. Our result
improves and generalizes previous results of Li et al. (European J. Combin. 108
(2023), 103627), which state that every flow-admissible signed
-edge-colorable cubic graph admits a nowhere-zero -flow, and that every
flow-admissible signed hamiltonian graph admits a nowhere-zero -flow.Comment: 12 pages, 2 figure
Flows on Signed Graphs
This dissertation focuses on integer flow problems within specific signed graphs. The theory of integer flows, which serves as a dual problem to vertex coloring of planar graphs, was initially introduced by Tutte as a tool related to the Four-Color Theorem. This theory has been extended to signed graphs.
In 1983, Bouchet proposed a conjecture asserting that every flow-admissible signed graph admits a nowhere-zero 6-flow. To narrow dawn the focus, we investigate cubic signed graphs in Chapter 2. We prove that every flow-admissible 3-edge-colorable cubic signed graph admits a nowhere-zero 10-flow. This together with the 4-color theorem implies that every flow-admissible bridgeless planar signed graph admits a nowhere-zero 10-flow. As a byproduct of this research, we also demonstrate that every flow-admissible hamiltonian signed graph can admit a nowhere-zero 8-flow.
In Chapter 3, we delve into triangularly connected signed graphs. Here, A triangle-path in a graph G is defined as a sequence of distinct triangles in G such that for any i, j with , and if . We categorize a connected graph as triangularly connected if it can be demonstrated that for any two nonparallel edges and , there exists a triangle-path such that and . For ordinary graphs, Fan {\it et al.} characterized all triangularly connected graphs that admit nowhere-zero -flows or -flows. Corollaries of this result extended to integer flow in certain families of ordinary graphs, such as locally connected graphs due to Lai and certain types of products of graphs due to Imrich et al. In this dissertation, we extend Fan\u27s result for triangularly connected graphs to signed graphs. We proved that a flow-admissible triangularly connected signed graph admits a nowhere-zero -flow if and only if is not the wheel associated with a specific signature. Moreover, this result is proven to be sharp since we identify infinitely many unbalanced triangularly connected signed graphs that can admit a nowhere-zero 4-flow but not 3-flow.\\
Chapter 4 investigates integer flow problems within -minor free signed graphs. A minor of a graph refers to any graph that can be derived from through a series of vertex and edge deletions and edge contractions. A graph is considered -minor free if is not a minor of . While Bouchet\u27s conjecture is known to be tight for some signed graphs with a flow number of 6. Kompi\v{s}ov\\u27{a} and M\\u27{a}\v{c}ajov\\u27{a} extended those signed graph with a specific signature to a family \M, and they also put forward a conjecture that suggests if a flow-admissible signed graph does not admit a nowhere-zero 5-flow, then it belongs to \M. In this dissertation, we delve into the members in \M that are -minor free, designating this subfamily as . We provide a proof demonstrating that every flow-admissible, -minor free signed graph admits a nowhere-zero 5-flow if and only if it does not belong to the specified family
Modeling and Tuning of Energy Harvesting Device Using Piezoelectric Cantilever Array
Piezoelectric devices have been increasingly investigated as a means of converting ambient vibrations into electrical energy that can be stored and used to power other devices, such as the sensors/actuators, micro-electro-mechanical systems (MEMS) devices, and microprocessor units etc. The objective of this work was to design, fabricate, and test a piezoelectric device to harvest as much power as possible from vibration sources and effectively store the power in a battery.;The main factors determining the amount of collectable power of a single piezoelectric cantilever are its resonant frequency, operation mode and resistive load in the charging circuit. A proof mass was used to adjust the resonant frequency and operation mode of a piezoelectric cantilever by moving the mass along the cantilever. Due to the tiny amount of collected power, a capacitor was suggested in the charging circuit as an intermediate station. To harvest sufficient energy, a piezoelectric cantilever array, which integrates multiple cantilevers in parallel connection, was investigated.;In the past, most prior research has focused on the theoretical analysis of power generation instead of storing generated power in a physical device. In this research, a commercial solid-state battery was used to store the power collected by the proposed piezoelectric cantilever array. The time required to charge the battery up to 80% capacity using a constant power supply was 970 s. It took about 2400 s for the piezoelectric array to complete the same task. Other than harvesting energy from sinusoidal waveforms, a vibration source that emulates a real environment was also studied. In this research the response of a bridge-vehicle system was used as the vibration sources such a scenario is much closer to a real environment compared with typical lab setups