Results 21 to 30 of about 278,151 (262)

Sequence mixed graphs

Discrete Applied Mathematics, 2017
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the ...
Dalfó Simó, Cristina, Fiol Mora, Miquel Àngel, López, Nacho   +2 more
openaire   +4 more sources

MixedGraphinFuzzy,Neutrosophic, and Plithogenic Graphs [PDF]

Neutrosophic Sets and Systems
Graph theory examines networks consisting of nodes (vertices) and the connections (edges) between them. Mixed graphs, which combine both undirected and directed edges, provide a versatile framework for representing relationships with symmetric and ...
Florentin Smarandache, Takaaki Fujita
doaj   +1 more source

Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs

Journal of Inequalities and Applications, 2017
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

$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]

Transactions on Combinatorics, 2018
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 mixed Moore graphs

Discrete Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minh Hoang Nguyen, Mirka Miller, Joan Gimbert   +2 more
openaire   +1 more source

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
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, M. R. Hooshmandasl, M. J. Dinneen, A. Shakiba   +3 more
doaj   +1 more source

The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs

Theory and Applications of Graphs, 2023
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, Mohammad Abudayah, Manal Ghanem   +2 more
doaj   +1 more source

Stochastic and mixed flower graphs [PDF]

Physical Review E, 2020
11 pages, 6 ...
C. Tyler Diggans, Erik M. Bollt, Daniel ben-Avraham   +2 more
openaire   +3 more sources

Computing Fault-Tolerant Metric Dimension of Connected Graphs

Journal of Mathematics, 2022
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, Sara Ahmed, Muhammad Javaid, Md Nur Alam   +3 more
doaj   +1 more source

Locally Differentially Private Heterogeneous Graph Aggregation with Utility Optimization

Entropy, 2023
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, Liusheng Huang, Hongli Xu, Wei Yang   +3 more
doaj   +1 more source