نتایج جستجو برای: n distance balanced graph
تعداد نتایج: 1380207 فیلتر نتایج به سال:
In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given n and e, we determine the minimum degree distance of a connected graph of order n and size e.
We present an O(n) algorithm that computes a maximum stable set of any perfect graph with no balanced skew-partition. We present O(n) time algorithm that colors them.
Graph matching is a fundamental problem in Computer Vision and Machine Learning. We present two contributions. First, we give a new spectral relaxation technique for approximate solutions to matching problems, that naturally incorporates one-to-one or one-to-many constraints within the relaxation scheme. The second is a normalization procedure for existing graph matching scoring functions that ...
For a graph G where the vertices are coloured, the coloured distance of G is defined as the sum of the distances between all unordered pairs of vertices having different colours. Then for a fixed supply s of colours, ds(G) is defined as the minimum coloured distance over all colourings with s. This generalizes the concepts of median and average distance. In this paper we explore bounds on this ...
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups. Moreover, in Section 5 of this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that every Berge graph either is in a well understood basic class or has some kind of decomposition. Then, Chudnovsky proved stronger theorems. One ...
let $g$ be an $(n,m)$-graph. we say that $g$ has property $(ast)$if for every pair of its adjacent vertices $x$ and $y$, thereexists a vertex $z$, such that $z$ is not adjacentto either $x$ or $y$. if the graph $g$ has property $(ast)$, thenits complement $overline g$ is connected, has diameter 2, and itswiener index is equal to $binom{n}{2}+m$, i.e., the wiener indexis insensitive of any other...
mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. in theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. the wiener polarity index ...
a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the li...
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number of nodes at a distance k from the identity node in a star graph where k varies from 0 to the diameter of the graph. A star graph is a Cayley graph like the hypercubes; for a hypercube Qn, there are exactly ` n r ́ node...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید