3-Factor-criticality in double domination edge critical graphs

A vertex subset $S$ of a graph $G$ is a double dominating set of $G$ if $|N[v]\cap S|\geq 2$ for each vertex $v$ of $G$, where $N[v]$ is the set of the vertex $v$ and vertices adjacent to $v$. The double domination number of $G$, denoted by $\gamma_{\times 2}(G)$, is the cardinality of a smallest double dominating set of $G$. A graph $G$ is said to be double domination edge critical if $\gamma_{\times 2}(G+e)<\gamma_{\times 2}(G)$ for any edge $e \notin E$. A double domination edge critical graph $G$ with $\gamma_{\times 2}(G)=k$ is called $k$-$\gamma_{\times 2}(G)$-critical. A graph $G$ is $r$-factor-critical if $G-S$ has a perfect matching for each set $S$ of $r$ vertices in $G$. In this paper we show that $G$ is 3-factor-critical if $G$ is a 3-connected claw-free $4$-$\gamma_{\times 2}(G)$-critical graph of odd order with minimum degree at least 4 except a family of graphs.Comment: 14 page

Distances and Domination in Graphs

This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networks’ curvatures is also present

Improved fault-tolerant PMU placement using algebraic connectivity of graphs

Due to perpetual and innovative technological advancements, the need for reliable and stable power generation and transmission has been increasing dramatically over the years. Smart grids use advanced technologies to provide self-monitoring, self-checking and self-healing power networks, including smart metering devices capable of providing accurate measurements of the network\u27s power components. Among the most important metering devices in this context are Phasor Measurement Units (PMUs) . PMUs are metering devices that provide synchronized measurements of voltage, current and phase angle differences using signals from the GPS satellites. However, due to the high cost of such advanced metering devices, studies were performed to determine the minimum number of PMUs required and their strategic placements in the power networks to provide full system observability. In this thesis, we consider fault-tolerant PMU placement aiming to minimize the number of PMUs while maintaining system observability under various contingencies. Conventionally, the optimal number of PMUs in a system is determined based on the system\u27s connectivity matrix under no contingency. This thesis considers fault- tolerant PMU placement under single and double branch failures. We propose algebraic connectivity, or Fiedler value, to identify the worst- case branch failures in terms of connectivity degradation. The proposed PMU placement accounts for this worst-case and covers a large percentage of other single and double branch failures. Furthermore, we propose the usage of Fiedler vector to provide a PMU placement that would ensure that the system remains fully observable during system partitioning into separate sub-systems. The resulting placements are compared with those obtained without considering connectivity degradation or system partitioning in terms of the percentages of observable systems during any single and double branch failures. The proposed PMU placements have increased percentages of fully observable systems in the event of any single or double branch failures compared to non—contingency based placement, with a reasonable increase in number of PMUs, and for some placement approaches no increase in PMUs is needed for providing a higher percentage of fully observable systems

Improved fault-tolerant PMU placement using algebraic connectivity of graphs

Due to perpetual and innovative technological advancements, the need for reliable and stable power generation and transmission has been increasing dramatically over the years. Smart grids use advanced technologies to provide self-monitoring, self-checking and self-healing power networks, including smart metering devices capable of providing accurate measurements of the network’s power components. Among the most important metering devices in this context are “Phasor Measurement Units (PMUs)â€. PMUs are metering devices that provide synchronized measurements of voltage, current and phase angle differences using signals from the GPS satellites. However, due to the high cost of such advanced metering devices, studies were performed to determine the minimum number of PMUs required and their strategic placements in the power networks to provide full system observability. In this thesis, we consider fault-tolerant PMU placement aiming to minimize the number of PMUs while maintaining system observability under various contingencies. Conventionally, the optimal number of PMUs in a system is determined based on the system’s connectivity matrix under no contingency. This thesis considers fault- tolerant PMU placement under single and double branch failures. We propose algebraic connectivity, or Fiedler value, to identify the worst- case branch failures in terms of connectivity degradation. The proposed PMU placement accounts for this worst-case and covers a large percentage of other single and double branch failures. Furthermore, we propose the usage of Fiedler vector to provide a PMU placement that would ensure that the system remains fully observable during system partitioning into separate sub-systems. The resulting placements are compared with those obtained without considering connectivity degradation or system partitioning in terms of the percentages of observable systems during any single and double branch failures. The proposed PMU placements have increased percentages of fully observable systems in the event of any single or double branch failures compared to non—contingency based placement, with a reasonable increase in number of PMUs, and for some placement approaches no increase in PMUs is needed for providing a higher percentage of fully observable systems

Explosive Percolation: Unusual Transitions of a Simple Model

In this paper we review the recent advances on explosive percolation, a very sharp phase transition first observed by Achlioptas et al. (Science, 2009). There a simple model was proposed, which changed slightly the classical percolation process so that the emergence of the spanning cluster is delayed. This slight modification turns out to have a great impact on the percolation phase transition. The resulting transition is so sharp that it was termed explosive, and it was at first considered to be discontinuous. This surprising fact stimulated considerable interest in "Achlioptas processes". Later work, however, showed that the transition is continuous (at least for Achlioptas processes on Erdos networks), but with very unusual finite size scaling. We present a review of the field, indicate open "problems" and propose directions for future research.Comment: 27 pages, 4 figures, Review pape