Results 41 to 50 of about 96,090 (258)
Covering a graph by complete bipartite graphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, László Pyber
openaire +2 more sources
ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]
Journal of Algebraic SystemsRecently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi +2 more
doaj +1 more source
Complete graphs and complete bipartite graphs without rainbow path
Discrete Mathematics, 2019 Motivated by Ramsey-type questions, we consider edge-colorings of complete graphs and complete bipartite graphs without rainbow path. Given two graphs G and H , the k -colored Gallai–Ramsey number g r k ( G : H ) is defined to be the minimum integer n ...
Xihe Li, Ligong Wang, Xiangxiang Liu
semanticscholar +1 more source
The IC-Indices of Complete Bipartite Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G$ be a connected graph, and let $f$ be a function mapping $V(G)$ into ${\Bbb N}$. We define $f(H)=\sum_{v\in{V(H)}}f(v)$ for each subgraph $H$ of $G$. The function $f$ is called an IC-coloring of $G$ if for each integer $k$ in the set $\{1,2,\cdots,f(G)\}$ there exists an (induced) connected subgraph $H$ of $G$ such that $f(H)=k$, and the IC ...
Chin-Lin Shiue, Hung-Lin Fu
openaire +3 more sources
On multiplicity of quadrilaterals
AKCE International Journal of Graphs and Combinatorics, 2015 Let Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n.
S.S. Rukmani, V. Vijayalakshmi
doaj +1 more source
Anti-Ramsey theory on complete bipartite graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho +3 more
doaj +1 more source
Topological drawings of complete bipartite graphs
Journal of Computational Geometry, 2018 Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points.
Jean Cardinal, Stefan Felsner
doaj +1 more source
ABC energies and spectral radii of some graph operations
Frontiers in Physics, 2022 The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
Local colourings and monochromatic partitions in complete bipartite graphs [PDF]
European journal of combinatorics (Print), 2015 We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths.
R. Lang, M. Stein
semanticscholar +1 more source
Matching graphs of Hypercubes and Complete Bipartite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources