Results 21 to 30 of about 1,555,880 (294)

The Balancing Number and Generalized Balancing Number of Some Graph Classes

open access: yesThe Electronic Journal of Combinatorics, 2023
Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If there exists an integer $k$ such that, for $n$ sufficiently large, every 2-coloring of $K_n$ with more than $k$ edges in each color contains a balanced copy of $G$, then we ...
Antoine Dailly   +3 more
openaire   +2 more sources

Balances in the Set of Arithmetic Progressions

open access: yesAxioms, 2021
This article focuses on searching and classifying balancing numbers in a set of arithmetic progressions. The sufficient and necessary conditions for the existence of balancing numbers are presented.
Chan-Liang Chung   +2 more
doaj   +1 more source

On the Number of Balanced Lines [PDF]

open access: yesDiscrete & Computational Geometry, 2001
Given a set of \(n\) black and \(n\) white points in general position in the plane, a line \(l\) determined by two of them is said to be balanced, if each open halfplane determined by \(l\) contains exactly the same number of white points and black points. The authors prove that the number of balanced lines is at least \(n\).
Pach, János, Pinchasi, Rom
openaire   +4 more sources

Repdigits in the base $b$ as sums of four balancing numbers [PDF]

open access: yesMathematica Bohemica, 2021
The sequence of balancing numbers $(B_n)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\geq2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $
Refik Keskin, Fatih Erduvan
doaj   +1 more source

On the Properties of Balancing and Lucas-Balancing $p$-Numbers

open access: yesIranian Journal of Mathematical Sciences and Informatics, 2022
Summary: The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing \(p\)-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.
Behera, Adikanda, Ray, Prasanta Kumar
openaire   +2 more sources

Classes of gap balancing numbers [PDF]

open access: yesRocky Mountain Journal of Mathematics, 2021
14 ...
Bartz, Jeremiah   +2 more
openaire   +3 more sources

The Number of Generalized Balanced Lines [PDF]

open access: yesDiscrete & Computational Geometry, 2010
6 pages, 3 figures, several typos fixed, reference ...
David Orden   +2 more
openaire   +3 more sources

Shift Balancing Numbers

open access: yesThe Journal of the Indian Mathematical Society, 2020
For each positive integer k, the Diophantine equation (k+1)+(k+2)+···+(n−1) = (n+1)+(n+2)+···+(n+r) is studied.
Rayaguru, S. G.   +2 more
openaire   +1 more source

On tridimensional Lucas-balancing numbers and some properties [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
In this article, we introduce the tridimensional version of the Lucas-balancing numbers based on the unidimensional version, and we also study some of their properties and sum identities.
J. Chimpanzo   +2 more
doaj   +1 more source

On the Balanced Decomposition Number [PDF]

open access: yesGraphs and Combinatorics, 2015
A {\em balanced coloring} of a graph $G$ means a triple $\{P_1,P_2,X\}$ of mutually disjoint subsets of the vertex-set $V(G)$ such that $V(G)=P_1 \uplus P_2 \uplus X$ and $|P_1|=|P_2|$. A {\em balanced decomposition} associated with the balanced coloring $V(G)=P_1 \uplus P_2 \uplus X$ of $G$ is defined as a partition of $V(G)=V_1 \uplus \cdots \uplus ...
openaire   +4 more sources

Home - About - Disclaimer - Privacy