Results 11 to 20 of about 2,896,689 (257)
On the Upward Planarity of Mixed Plane Graphs [PDF]
A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed ...
Fabrizio Frati +4 more
doaj +2 more sources
Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars
Graph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete ...
Robert Gardner, Kazeem Kosebinu
doaj +2 more sources
A Geometric Property of the Laplacian matrix of a Connected Nonsingular Mixed Graph
In this paper, we give a geometric interpretation of the Laplacian matrix of a connected nonsingular mixed graph which generalizes the results of M. Fiedler (M. Fiedler, Geometry of the Laplacian, Linear Algebra Appl., 2005, 403: 409–413).
Zheng-Da Zhou, Shi-Cai Gong
doaj +2 more sources
On spectra of unitary Cayley mixed graph [PDF]
In this paper we introduce mixed unitary Cayley graph $M_{n}$ $(n>1)$ and compute its eigenvalues. We also compute the energy of $M_{n}$ for some $n$.
Chandrashekar Adiga +1 more
doaj +1 more source
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
MixedGraphinFuzzy,Neutrosophic, and Plithogenic Graphs [PDF]
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
Decompositions of the Complete Mixed Graph by Mixed Stars [PDF]
In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph?
Culver, Chance
core +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
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj +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

