Results 31 to 40 of about 282,172 (197)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minh Hoang Nguyen +2 more
openaire +1 more source
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width [PDF]
A mixed dominating set for a graph $G = (V,E)$ is a set $S\subseteq V \cup E$ such that every element $x \in (V \cup E) \backslash S$ is either adjacent or incident to an element of $S$. The mixed domination number of a graph $G$, denoted by $\gamma_m(G)$
M. Rajaati +3 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
Computing Fault-Tolerant Metric Dimension of Connected Graphs
For a connected graph, the concept of metric dimension contributes an important role in computer networking and in the formation of chemical structures.
Uzma Ahmad +3 more
doaj +1 more source
ON SPECTRA OF HERMITIAN RANDIĆ MATRIX OF SECOND KIND [PDF]
Let $X$ be a mixed graph and $\omega=\frac{1+\i \sqrt{3}}{2}$. We write $i\rightarrow j$, if there is an oriented edge from a vertex $v_i$ to another vertex $v_j$, and $i\sim j$ for an un-oriented edge between the vertices $v_i$ and $v_j$.
A Bharali +3 more
doaj +1 more source
Locally Differentially Private Heterogeneous Graph Aggregation with Utility Optimization
Graph data are widely collected and exploited by organizations, providing convenient services from policy formation and market decisions to medical care and social interactions.
Zichun Liu +3 more
doaj +1 more source
Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
Let M be a mixed graph and H ( M ) $H(M)$ be its Hermitian-adjacency matrix. If we add a Randić weight to every edge and arc in M, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix?
Yong Lu, Ligong Wang, Qiannan Zhou
doaj +1 more source
A Comparative Study of Three Resolving Parameters of Graphs
Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures,
Hafiz Muhammad Ikhlaq +2 more
doaj +1 more source
Stochastic and mixed flower graphs [PDF]
11 pages, 6 ...
C. Tyler Diggans +2 more
openaire +3 more sources

