On Infinite n-Connected Graphs

1990 ◽  
pp. 151-160 ◽  
Author(s):  
W. Mader
Keyword(s):  
Connected Graphs

scholarly journals The Formula to Count The Number of Vertices Labeled Order Six Connected Graphs with Maximum Thirty Edges without Loops

2021 ◽  
Vol 1751 ◽  
pp. 012023
Author(s):  
F C Puri ◽  
Wamiliana ◽  
M Usman ◽  
Amanto ◽  
M Ansori ◽  
...  
Keyword(s):  
Connected Graphs

scholarly journals On minimum algebraic connectivity of graphs whose complements are bicyclic

2019 ◽  
Vol 17 (1) ◽  
pp. 1490-1502 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Javaid ◽  
Mohsin Raza ◽  
Naeem Saleem
Keyword(s):  
Connected Graph ◽  
Diffusion Processes ◽  
Laplacian Matrix ◽  
Group Differences ◽  
Algebraic Connectivity ◽  
Connected Graphs ◽  
Bicyclic Graph ◽  
Smallest Eigenvalue ◽  
Unique Graph ◽  
The Stability

Abstract The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model, synchronize the stability, analyze the diffusion processes and find the connectivity of the graphs (networks). A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. In this paper, firstly the unique graph with a minimum algebraic connectivity is characterized in the class of connected graphs whose complements are bicyclic with exactly three cycles. Then, we find the unique graph of minimum algebraic connectivity in the class of connected graphs $\begin{array}{} {\it\Omega}^c_{n}={\it\Omega}^c_{1,n}\cup{\it\Omega}^c_{2,n}, \end{array}$ where $\begin{array}{} {\it\Omega}^c_{1,n} \end{array}$ and $\begin{array}{} {\it\Omega}^c_{2,n} \end{array}$ are classes of the connected graphs in which the complement of each graph of order n is a bicyclic graph with exactly two and three cycles, respectively.

scholarly journals Dynamics of epidemic spreading on connected graphs

2021 ◽  
Vol 82 (6) ◽  
Author(s):  
Christophe Besse ◽  
Grégory Faye
Keyword(s):  
Epidemic Spreading ◽  
Connected Graphs

Independent sets in n-vertex k-chromatic ℓ-connected graphs

2021 ◽  
Vol 344 (7) ◽  
pp. 112376
Author(s):  
John Engbers ◽  
Lauren Keough ◽  
Taylor Short
Keyword(s):  
Independent Sets ◽  
Connected Graphs

A constructive characterization of contraction critical 8-connected graphs with minimum degree 9

2019 ◽  
Vol 342 (11) ◽  
pp. 3047-3056
Author(s):  
Chengfu Qin ◽  
Weihua He ◽  
Kiyoshi Ando
Keyword(s):  
Minimum Degree ◽  
Connected Graphs

scholarly journals Peg Solitaire on Cartesian Products of Graphs

2021 ◽  
Vol 37 (3) ◽  
pp. 907-917
Author(s):  
Martin Kreh ◽  
Jan-Hendrik de Wiljes
Keyword(s):  
Cartesian Product ◽  
Cartesian Products ◽  
Connected Graphs ◽  
Grid Graphs ◽  
Cartesian Products Of Graphs

AbstractIn 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. In the same article, the authors proved some results on the solvability of Cartesian products, given solvable or distance 2-solvable graphs. We extend these results to Cartesian products of certain unsolvable graphs. In particular, we prove that ladders and grid graphs are solvable and, further, even the Cartesian product of two stars, which in a sense are the “most” unsolvable graphs.

scholarly journals Least eigenvalue of the connected graphs whose complements are cacti

2019 ◽  
Vol 17 (1) ◽  
pp. 1319-1331
Author(s):  
Haiying Wang ◽  
Muhammad Javaid ◽  
Sana Akram ◽  
Muhammad Jamal ◽  
Shaohui Wang
Keyword(s):  
Linear Algebra ◽  
Adjacency Matrix ◽  
Connected Graphs ◽  
Least Eigenvalue ◽  
The Family

Abstract Suppose that Γ is a graph of order n and A(Γ) = [ai,j] is its adjacency matrix such that ai,j is equal to 1 if vi is adjacent to vj and ai,j is zero otherwise, where 1 ≤ i, j ≤ n. In a family of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix is minimum in the set of the least eigenvalues of all the graphs. Petrović et al. [On the least eigenvalue of cacti, Linear Algebra Appl., 2011, 435, 2357-2364] characterized a minimizing graph in the family of all cacti such that the complement of this minimizing graph is disconnected. In this paper, we characterize the minimizing graphs G ∈ $\begin{array}{} {\it\Omega}^c_n \end{array}$, i.e. $$\begin{array}{} \displaystyle \lambda_{min}(G)\leq\lambda_{min}(C^c) \end{array}$$ for each Cc ∈ $\begin{array}{} {\it\Omega}^c_n \end{array}$, where $\begin{array}{} {\it\Omega}^c_n \end{array}$ is a collection of connected graphs such that the complement of each graph of order n is a cactus with the condition that either its each block is only an edge or it has at least one block which is an edge and at least one block which is a cycle.

The Effect of Local Majority on Global Majorityin Connected Graphs

2018 ◽  
Vol 34 (6) ◽  
pp. 1469-1487
Author(s):  
Yair Caro ◽  
Raphael Yuster
Keyword(s):  
Connected Graphs
Sign in / Sign up

Export Citation Format

Share Document