Related papers: Optimal conditions for $(L_1;L_2)$ to be forcibly …

Let $A=(a_1,\ldots,a_n)$ and $B=(b_1,\ldots,b_n)$ be two sequences of nonnegative integers with $a_i \le b_i$ for $1\le i\le n$. The pair $(A;B)$ is said to be realizable by a graph if there exists a simple graph $G$ with vertices…

A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…

In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…

Let $A_n=(a_1,a_2,\ldots,a_n)$ and $B_n=(b_1,b_2,\ldots,b_n)$ be nonnegative integer sequences with $A_n\le B_n$. The purpose of this note is to give a good characterization such that every integer sequence $\pi=(d_1,d_2,\ldots d_n)$ with…

A non-increasing sequence $\pi=(d_1,\ldots,d_n)$ of nonnegative integers is said to be graphic if it is realizable by a simple graph $G$ on $n$ vertices. A graphic sequence $\pi=(d_1,\ldots,d_n)$ is said to be potentially $_3C_\ell$-graphic…

We provide upper bounds on the $L(p,q)$-labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an $L(p,q)$-labeling with span at most…

We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their largest and smallest elements.

We consider the problem of realizable interval-sequences. An interval sequence comprises of $n$ integer intervals $[a_i,b_i]$ such that $0\leq a_i \leq b_i \leq n-1$, and is said to be graphic/realizable if there exists a graph with degree…

Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. The necessary and sufficient con- ditions are given to assure the existence of a maximal ideal in $L$ and also the necessary…

In this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval…

An interval graph is proper iff it has a representation in which no interval contains another. Fred Roberts characterized the proper interval graphs as those containing no induced star $K_{1,3}$. Proskurowski and Telle have studied…

There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…

Suppose a sequence of random variables {X_n} has negative drift when above a certain threshold and has increments bounded in L^p. When p>2 this implies that EX_n is bounded above by a constant independent of n and the particular sequence…

Two groups $L_1$ and $L_2$ are compatible if there exists a finite group $G$ with isomorphic normal subgroups $N_1$ and $N_2$ such that $L_1\cong G/N_1$ and $L_2\cong G/N_2$. In this paper, we give new necessary conditions for two groups to…

Here in particular, we give a characterization of Quasi-line Graphs in terms of forbidden induced subgraphs. In general, we prove a necessary and sufficient condition for a graph to be a union of two cliques.

We consider the following feasibility problem: given an integer $n \geq 1$ and an integer $m$ such that $0 \leq m \leq \binom{n}{2}$, does there exist a line graph $L = L(G)$ with exactly $n$ vertices and $m$ edges ? We say that a pair…

Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complexity O(nm^6(m + n) \log n) and it was developed in 1997 [18].…

This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…

In this work, we obtain the following new results. 1. Given a sequence $D=((h_1,s_1), (h_2,s_2) ..., (h_n,s_n))$ of number pairs, where $s_i>0$ for all $i$, and a number $L_h$, we propose an O(n)-time algorithm for finding an index interval…

We give necessary and sufficient conditions for a few classes of known circulant graphs and/or digraphs to be singular. The above graph classes are generalized to $(r,s,t)$-digraphs for non-negative integers $r,s$ and $t$, and the digraph…