Related papers: The connectivity dimension of a graph
Whether comparing networks to each other or to random expectation, measuring dissimilarity is essential to understanding the complex phenomena under study. However, determining the structural dissimilarity between networks is an ill-defined…
The subgraph number of a vertex in a graph is defined as the number of connected subgraphs containing that vertex. The graph and its vertex which correspond to the minimum subgraph number among all graphs on $n$ vertices and $k$ cut…
We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…
A network picture has been applied to various physical and biological systems to understand their governing mechanisms intuitively. Utilizing discretization schemes, both electrical and optical materials can also be interpreted as abstract…
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network…
In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
The richness that characterizes relationships is often absent when they are modeled using computational methods in network science. Typically, relationships are represented simply as links, perhaps with weights. The lack of finer…
Given a finite, simple graph $G$, the $k$-component order edge connectivity of $G$ is the minimum number of edges whose removal results in a subgraph for which every component has order at most $k-1$. In general, determining the…
A new metric for quantifying pairwise vertex connectivity in graphs is defined and an implementation presented. While general in nature, it features a combination of input features well-suited for social networks, including applicability to…
Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…
Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $\lambda(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $\delta(G)$ be the minimum degree of $G$. It is well-known that $\lambda(G) \leq…
Universality is one of the key concepts in understanding critical phenomena. However, for interacting inhomogeneous systems described by complex networks a clear understanding of the relevant parameters for universality is still missing.…
A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. Let $\{G_1, G_2, \ldots,…
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…
One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with non-dyadic, higher-order…
In this paper, we introduce and study a new distance parameter {\it triameter} of a connected graph $G$, which is defined as $max\{d(u,v)+d(v,w)+d(u,w): u,v,w \in V\}$ and is denoted by $tr(G)$. We find various upper and lower bounds on…
Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the \emph{geodetic set}, \emph{edge geodetic set}, \emph{strong edge geodetic set}, and \emph{monitoring edge geodetic set}, with…
The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G,…