نتایج جستجو برای: balanced graphs

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

Journal: :European Journal of Combinatorics 2010

Journal: :Discrete Mathematics 2012

Journal: :Proceedings of the Edinburgh Mathematical Society 1981

Journal: :transactions on combinatorics 2011
m. tavakoli h. yousefi-azari ali reza ashrafi

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

Journal: :Electronic Notes in Discrete Mathematics 2010
Flavia Bonomo Guillermo Durán Martín Darío Safe Annegret Wagler

A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs gener...

In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.

Journal: :Discrete Applied Mathematics 2010
Arthur M. Hobbs Lavanya Kannan Hong-Jian Lai Hongyuan Lai Guoqing Weng

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Balanced graphs 1-balanced graphs Cartesian product of graphs Web graphs a b s t r a c t There are several density...

Journal: :Math. Program. 2006
Flavia Bonomo Guillermo Durán Min Chih Lin Jayme Luiz Szwarcfiter

Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced graphs by forbidden subgraphs and by clique subgraphs are proved in this work. Using properties of domination we define four subclasses of balanced graphs. Two of them are char...

Journal: :International Journal of Engineering Research and Applications 2017

Journal: :Discussiones Mathematicae Graph Theory 2021

A bihole in a bipartite graph $G$ with partite sets $A$ and $B$ is an independent set $I$ $|I\cap A|=|I\cap B|$. We prove lower bounds on the largest order of biholes balanced graphs subject to conditions involving vertex degrees average degree.

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

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