相关论文: Set Representations of Linegraphs

To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…

Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…

A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its…

Given a finite nonabelian semisimple group $G$, we describe those groups that have the same holomorph as $G$, that is, those regular subgroups $N\simeq G$ of $S(G)$, the group of permutations on the set $G$, such that…

Two $G$-sets ($G$ a finite group) are called linearly equivalent over a commutative ring $k$ if the permutation representations $k[X]$ and $k[Y]$ are isomorphic as modules over the group algebra $kG$. Pairs of linearly equivalent…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

Let G be a semi-simple non-compact Lie group with unitary lowest/highest weight representations. We consider explicitly the relation between three types of representations of G: positive energy (unitary lowest weight)representations,…

We introduce the set $\mathcal{G}^{\rm SSP}$ of all simple graphs $G$ with the property that each symmetric matrix corresponding to a graph $G \in \mathcal{G}^{\rm SSP}$ has the strong spectral property. We find several families of graphs…

Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…

A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A…

For $S \subset \mathbb{R}^n$ and $d > 0$, denote by $G(S, d)$ the graph with vertex set $S$ with any two vertices being adjacent if and only if they are at a Euclidean distance $d$ apart. Deem such a graph to be ``non-trivial" if $d$ is…

For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent…

A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…

A graph $G = (\{1, 2, \ldots, n\}, E)$ is $12$-representable if there is a word $w$ over $\{1, 2, \ldots, n\}$ such that two vertices $i$ and $j$ with $i < j$ are adjacent if and only if every $j$ occurs before every $i$ in $w$. These…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

A path separator of a graph $G$ is a set of paths $\mathcal{P}=\{P_1,\ldots,P_t\}$ such that for every pair of edges $e,f\in E(G)$, there exist paths $P_e,P_f\in\mathcal{P}$ such that $e\in E(P_e)$, $f\not\in E(P_e)$, $e\not\in E(P_f)$ and…