Results 31 to 40 of about 143,400 (232)
Nullity and Bounds to the Nullity of Dendrimer Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and star graphs.
Khidir Sharaf, Didar Ali
doaj +1 more source
A note on the DP-chromatic number of complete bipartite graphs [PDF]
Discrete Mathematics, 2018 DP-coloring (also called correspondence coloring) is a generalization of list coloring recently introduced by Dvo\v{r}\'{a}k and Postle. Several known bounds for the list chromatic number of a graph $G$, $\chi_\ell(G)$, also hold for the DP-chromatic ...
Jeffrey A. Mudrock
semanticscholar +1 more source
Minimum k-critical-bipartite graphs: the irregular case [PDF]
Opuscula MathematicaWe study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz +2 more
doaj +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs [PDF]
Quantum Information Processing, 2016 We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs.
M. Štefaňák, S. Skoupý
semanticscholar +1 more source
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs [PDF]
Czechoslovak Mathematical Journal, 1983 Let B be a bipartite graph on the vertex sets C, D. A homomorphism \(\phi\) of B onto a complete bipartite graph \(K_{r,s}\) is said to be bicomplete if \(\phi(x)=\phi(y)\) only if either both x, y belong to C, or both x, y belong to D. For a connected bipartite graph B, the author defines the parameter \(\beta_ 0(B)\) as the supremum of all values of ...
openaire +2 more sources
Rainbow perfect matchings in r-partite graph structures [PDF]
, 2016 A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
core +2 more sources
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On bipartite divisor graph for character degrees [PDF]
International Journal of Group Theory, 2017 The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95--105.].
Seyed Ali Moosavi
doaj +1 more source
Bounds for the Kirchhoff Index of Bipartite Graphs
Journal of Applied Mathematics, 2012 A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent ...
Yujun Yang
doaj +1 more source