Results 31 to 40 of about 3,087,593 (348)
MixedGraphinFuzzy,Neutrosophic, and Plithogenic Graphs [PDF]
Neutrosophic Sets and SystemsGraph 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
Rational mixed Tate motivic graphs [PDF]
Annals of K-Theory, 2017 53 ...
Patashnick, Owen A, Agarwala, Susama
openaire +5 more sources
$\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 Representing Mixed-Integer Linear Programs by Graph Neural Networks [PDF]
arXiv.org, 2022 While Mixed-integer linear programming (MILP) is NP-hard in general, practical MILP has received roughly 100--fold speedup in the past twenty years. Still, many classes of MILPs quickly become unsolvable as their sizes increase, motivating researchers to
Ziang Chen +4 more
semanticscholar +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 +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 +2 more
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
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 +3 more
doaj +1 more source
Mixing colourings in 2K2-free graphs
Discrete Mathematics, 2022 4 pages, 2 ...
Carl Feghali, Owen Merkel
openaire +2 more sources
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 +3 more
doaj +1 more source