相关论文: Maximum Frustration in Signed Generalized Petersen…

In this paper, we focus on the index ( largest eigenvalue) of the adjacency matrix of connected signed graphs. We give some general results on the index when the corresponding signed graph is perturbed. As applications, we determine the…

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…

A signed graph $ (G, \Sigma)$ is a graph positive and negative ($\Sigma $ denotes the set of negative edges). To re-sign a vertex $v$ of a signed graph $ (G, \Sigma)$ is to switch the signs of the edges incident to $v$. If one can obtain $…

A topological graph drawn on a cylinder whose base is horizontal is \emph{angularly monotone} if every vertical line intersects every edge at most once. Let $c(n)$ denote the maximum number $c$ such that every simple angularly monotone…

We focus on counting the number of labeled graphs on $n$ vertices and treewidth at most $k$ (or equivalently, the number of labeled partial $k$-trees), which we denote by $T_{n,k}$. So far, only the particular cases $T_{n,1}$ and $T_{n,2}$…

Vizing and Gupta showed that the chromatic index $\chi'(G)$ of a graph $G$ is bounded above by $\Delta(G) + \mu(G)$, where $\Delta(G)$ and $\mu(G)$ denote the maximum degree and the maximum multiplicity of $G$, respectively. Steffen refined…

Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \subseteq V(G)$ is a $dominating$ $set$ if for each $v \in V(G)$ either $v \in S$ or $v$ is adjacent to some $w \in S$. That…

A signed graph is a graph with edges marked positive and negative; it is unbalanced if some cycle has negative sign product. We introduce the concept of vector valued switching function in signed graphs, which extends the concept of…

A signed edge domination function (or SEDF) of a simple graph $G=(V,E)$ is a function $f: E\rightarrow \{1,-1\}$ such that $\sum_{e'\in N[e]}f(e')\ge 1$ holds for each edge $e\in E$, where $N[e]$ is the set of edges in $G$ that share at…

The star chromatic index of a graph $G$, denoted by $\chi^\prime_s(G)$, is the smallest integer $k$ for which $G$ admits a proper edge coloring with $k$ colors such that every path and cycle of length four is not bicolored. Let $d$ be the…

Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…

We prove that for any integers $p\geq k\geq 3$ and any $k$-tuple of positive integers $(n_1,\ldots ,n_k)$ such that $p=\sum _{i=1}^k{n_i}$ and $n_1\geq n_2\geq \ldots \geq n_k$, the condition $n_1\leq {p\over 2}$ is necessary and sufficient…

Signed graphs have their edges labeled either as positive or negative. $\rho(M)$ denote the $M$-spectral radius of $\Sigma$, where $M=M(\Sigma)$ is a real symmetric graph matrix of $\Sigma$. Obviously,…

The metric dimension of a graph $G$ is defined as the minimum number of vertices in a subset $S\subset V(G)$ such that all other vertices are uniquely determined by their distances to the vertices in $S$, and is denoted by $\dim(G)$. In…

The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing…

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao…

In this paper we find the number of different signatures of $P(3,1), P(5,1)$ and $P(7,1)$ upto switching isomorphism, where $P(n, k)$ denotes the generalised Petersen graph, $2k < n$. We also count the number of non-isomorphic signatures on…

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…

We introduce the concept of a $k$-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the…