نتایج جستجو برای: bipartite graph

تعداد نتایج: 204373  

Journal: :transactions on combinatorics 2013
lilly chen xueliang li mengmeng liu ivan gutman

hansen et‎. ‎al.‎, ‎using the autographix software ‎package‎, ‎conjectured that the szeged index $sz(g)$ and the‎ ‎wiener index $w(g)$ of a connected bipartite graph $g$ with $n geq ‎4$ vertices and $m geq n$ edges‎, ‎obeys the relation‎ ‎$sz(g)-w(g) geq 4n-8$‎. ‎moreover‎, ‎this bound would be the best possible‎. ‎this paper offers a proof to this conjecture‎.

Journal: :Discrete Mathematics 2009
Dancheng Lu Tongsuo Wu

A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We a...

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

‎In this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $C_4$-free.‎

Journal: :Ars Comb. 2012
Ryan C. Bunge Saad El-Zanati W. O'Hanlon Charles Vanden Eynden

An almost-bipartite graph is a non-bipartite graph with the property that the removal of a particular single edge renders the graph bipartite. A graph labeling of an almost-bipartite graph G with n edges that yields cyclic G-decompositions of the complete graph K2nt+1 was recently introduced by Blinco, El-Zanati, and Vanden Eynden. They called such a labeling a γ-labeling. Here we show that the...

Journal: :transactions on combinatorics 2014
ran gu fei huang xueliang li

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...

Journal: :SIAM Journal on Discrete Mathematics 2010

Journal: :IEEE Transactions on Dependable and Secure Computing 2019

Abolfazl Tehranian, Reza Taheri

Let $R$ be a commutative ring with identity and $mathbb{A}(R)$ be the set   of ideals of $R$ with non-zero annihilators. In this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_P(R)$. It is a (undirected) graph with vertices $mathbb{A}_P(R)=mathbb{A}(R)cap mathbb{P}(R)setminus {(0)}$, where   $mathbb{P}(R)$ is...

Journal: :Discrete Mathematics & Theoretical Computer Science 2012
Yoshio Okamoto Yota Otachi Ryuhei Uehara

The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper, we investigate a bipartite analogue of graph powers, which we call bipartite powers of bigraphs. We show that the classes of bipartite permutation graphs and interval bigraphs are closed under taking bipartite power. We also show that the problem of recognizing bipartite powers is NP-complete...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید