Results 1 to 10 of about 2,449,773 (154)
On Bipartite-Mixed Graphs [PDF]
AbstractMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore‐like bound is attained in the case of diameter , and that bipartite‐mixed graphs of diameter do not exist.
Cristina Dalfó Simó +2 more
exaly +8 more sources
A Mixed Strategy of Higher-Order Structure for Link Prediction Problem on Bipartite Graphs [PDF]
Link prediction tasks have an extremely high research value in both academic and commercial fields. As a special case, link prediction in bipartite graphs has been receiving more and more attention thanks to the great success of the recommender system in
Chao Li +5 more
doaj +4 more sources
Complexity of Two Coloring Problems in Cubic Planar Bipartite Mixed Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernard Ries
exaly +6 more sources
On Bipartite (1,1,k)-Mixed Graphs [PDF]
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs, in terms of the number of vertices, are presented for small diameters.
Cristina Dalfó Simó +2 more
exaly +10 more sources
Moore mixed graphs from Cayley graphs [PDF]
A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. When the order of G is close to M(
Cristina Dalfo, Miquel Àngel Fiol
doaj +2 more sources
Spectral energies of redefined Zagreb indices and comparative QSPR applications to anticancer and alcohol datasets [PDF]
This article develops a unified framework for the redefined Zagreb descriptors that combines graph theory, spectral analysis, and molecular structure–property applications.
Yusuf Zeren +2 more
doaj +2 more sources
On Symmetric Spectra of Hermitian Adjacency Matrices for Non-Bipartite Mixed Graphs
25 pages, 12 figures, 3 ...
Etsuo Segawa, Sho Kubota, Yusuke Higuchi
exaly +5 more sources
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
Total mixed domination in graphs
For a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum ...
Adel P. Kazemi +2 more
doaj +1 more source
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source

