Results 101 to 110 of about 153,964 (249)

A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs

open access: yesTheory and Applications of Graphs, 2018
Given a graph $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number $gr_{k}(K_{3} : H)$ is defined to be the minimum number of vertices $n$ for which any $k$-coloring of the complete graph $K_{n}$ contains either a rainbow triangle or a ...
Colton Magnant
doaj   +1 more source

Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum

open access: yesJournal of Mathematics, 2022
In this study, we investigate the Laplacian degree product spectrum and corresponding energy of four families of graphs, namely, complete graphs, complete bipartite graphs, friendship graphs, and corona products of 3 and 4 cycles with a null graph.
Asim Khurshid   +3 more
doaj   +1 more source

Bipartite 2‐Factorizations of Complete Multipartite Graphs [PDF]

open access: yesJournal of Graph Theory, 2014
AbstractIt is shown that if K is any regular complete multipartite graph of even degree, and F is any bipartite 2‐factor of K, then there exists a factorization of K into F; except that there is no factorization of K6, 6 into F when F is the union of two disjoint 6‐cycles.
Bryant, Darryn   +2 more
openaire   +3 more sources

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

open access: yesNetworks, EarlyView.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk   +2 more
wiley   +1 more source

Sidorenko's conjecture for blow-ups

open access: yesDiscrete Analysis, 2021
Sidorenko's conjecture for blow-ups, Discrete Analysis 2021:2, 13 pp. Let $G$ be a bipartite graph with finite vertex sets $X$ and $Y$. If $G$ has density $\alpha$, then the average degree of the vertices in $X$ is $\alpha|Y|$, so the mean-square degree
David Conlon, Joonkyung Lee
doaj   +1 more source

On the Line Graph of the Complete Bipartite Graph

open access: yes, 1964
In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case $m = n$, this question
A. Hoffman
semanticscholar   +1 more source

Rees algebras of complete bipartite graphs.

open access: yesMatemática Contemporânea, 1999
To every graph one can associate an ideal \(I\) generated by the products of the pairs of variables of the edges. This paper studies the Rees algebra \(R(I)\) of the edge ideal of complete bipartite graphs. It gives a Gröbner basis for the defining ideal and then uses it to compute the Hilbert series of \(R(I)\).
openaire   +2 more sources

Stratified sampling enhances the understanding of bat–fruit networks in the southern Atlantic Forest

open access: yesOikos, EarlyView.
Few studies have sought to understand the vertical patterns of bat–fruit systems, and therefore, it is not possible to evaluate whether interpretations based on data collected from a single stratum adequately represent the interaction patterns of this system. In this context, we evaluated the dissimilarity in the assemblage of frugivorous bats, plants,
Karolaine Porto Supi   +3 more
wiley   +1 more source

Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang   +7 more
wiley   +1 more source

Strong Domination in Fuzzy Graphs

open access: yesFuzzy Information and Engineering, 2015
In this paper, the concept of strong domination number is introduced by using membership values of strong arcs in fuzzy graphs. The strong domination number γs of complete fuzzy graph and complete bipartite fuzzy graph is determined and bounds is ...
O.T. Manjusha, M.S. Sunitha
doaj   +1 more source

Home - About - Disclaimer - Privacy