相关论文: Determining Finite Connected Graphs Along the Quad…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Signless Laplacian Estrada index of a graph $G$, defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$, where $q_1, q_2, \cdots, q_n$ are the eigenvalues of the matrix $\mathbf{Q}(G)=\mathbf{D}(G)+\mathbf{A}(G)$. We determine the unique graphs with…

We study Nordhaus-Gaddum problems for Kemeny's constant $\mathcal{K}(G)$ of a connected graph $G$. We prove bounds on $\min\{\mathcal{K}(G),\mathcal{K}(\overline{G})\}$ and the product $\mathcal{K}(G)\mathcal{K}(\overline{G})$ for various…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

Given a connected graph $G$ on $n$ vertices and a positive integer $k\le n$, a subgraph of $G$ on $k$ vertices is called a $k$-subgraph in $G$. We design combinatorial approximation algorithms for finding a connected $k$-subgraph in $G$…

The connective constant $\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying…

A $k$-$\gamma_{c}$-edge critical graph is a graph $G$ with the connected domination number $\gamma_{c}(G) = k$ and $\gamma_{c}(G + uv) < k$ for every $uv \in E(\overline{G})$. Further, a $2$-connected graph $G$ is said to be…

For a graph $G=(V,E)$ and a set $S\subseteq V(G)$ of size at least $2$, a path in $G$ is said to be an $S$-path if it connects all vertices of $S$. Two $S$-paths $P_1$ and $P_2$ are said to be internally disjoint if $E(P_1)\cap…

A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $g\in G$ of the graph, where $G$ is a group of…

We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…

The connective constant $\mu(G)$ of a graph $G$ is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. We investigate the validity of the inequality $\mu \ge \phi$ for infinite, transitive, simple,…

An ordered graph $G_<$ is a graph with a total ordering $<$ on its vertex set. A monotone path of length $k$ is a sequence of vertices $v_1<v_2<\ldots<v_k$ such that $v_iv_{j}$ is an edge of $G_<$ if and only if $|j-i|=1$. A bi-clique of…

A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…

The restricted edge-connectivity of a connected graph $G$, denoted by $\lambda^{\prime}(G)$, if it exists, is the minimum cardinality of a set of edges whose deletion makes $G$ disconnected and each component with at least 2 vertices. It…

Let $G$ be a graph. A set $S \subseteq V(G)$ is independent if its elements are pairwise non-adjacent. A vertex $v \in V(G)$ is shedding if for every independent set $S \subseteq V(G) \setminus N[v]$ there exists $u \in N(v)$ such that $S…

Let $G$ be a $k$-degenerate graph of order $n.$ It is well-known that $G\ $has no more edges than $S_{n,k},$ the join of a complete graph of order $k$ and an independent set of order $n-k.$ In this note it is shown that $S_{n,k}$ is…

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…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Let $G$ be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of $G$ that maintains respectively: the $2$-edge-connected blocks of $G$…