Results 51 to 60 of about 6,526 (216)

A note on global existence for boundary value problems

International Journal of Mathematics and Mathematical Sciences, 1989
Upper and lower solutions are used in establlsning global existence results for certain two–point boundary value problems for y‴=f(x,y,y′,y″) and y(n)=f(x,y,y′,...,y(n−1)).
Chuan J. Chyan, Johnny Henderson
doaj   +1 more source

The combinatorics of splittability

Annals of Pure and Applied Logic, 2004
Small ...
openaire   +3 more sources

Hex and combinatorics

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ryan B. Hayward, Jack van Rijswijck
openaire   +1 more source

A practical algorithm for weighted k‐hulls

Computer Graphics Forum, EarlyView.
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley   +1 more source

On Coloring of Fractional Powers of Star, Wheel, Friendship, and Fan Graphs

Indonesian Journal of Combinatorics
Let G be a simple, connected, and undirected graph. For m, n ∈ ℕ, the fractional power Gm/n = (G1/n)m of G is constructed by taking the n-subdivision of G (replacing each edge by a path of length n), and then raising the resulting graph to the m-th power
Farisan Hafizh, Muhammad Rayhanafraa Gibran Maulana, Citius Vienny, Bisma Rohpanca Joyosumarto, Kiki A. Sugeng   +4 more
doaj   +1 more source

Extremal skew energy of digraphs with no even cycles [PDF]

Transactions on Combinatorics, 2014
Let $D$ be a digraph with skew-adjacency matrix $S(D)$. Then the skew energy of $D$ is defined to be the sum of the norms of all eigenvalues of $S(D)$. Denote by $mathcal{O}_n$ the class of digraphs on order $n$ with no even cycles, and by $mathcal{O ...
Jing Li, Xueliang Li, Huishu Lian
doaj  

Graphs with 3-Rainbow Index n − 1 and n − 2

Discussiones Mathematicae Graph Theory, 2015
Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Li Xueliang, Schiermeyer Ingo, Yang Kang, Zhao Yan   +3 more
doaj   +1 more source

Teaching of probability theory and combinatorics at secondary schools

Lietuvos Matematikos Rinkinys, 2004
The topics of probability theory and combinatorics were brought into curricula of Lithuanian secondary schools ten years ago. The problems of teaching and actual situation of apprehension of concepts of prob­ability theory and combinatorics are analyzed.
Eugenijus Stankus
doaj   +3 more sources

The generalized 3-connectivity of Lexicographic product graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Xueliang Li, Yaping Mao
doaj   +1 more source

On the Limits of Intransitive Coordination

Ratio, EarlyView.
ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
wiley   +1 more source