Results 21 to 30 of about 412 (107)
Signed graphs with integral net Laplacian spectrum
AKCE International Journal of Graphs and Combinatorics, 2023 Given a signed graph [Formula: see text], let [Formula: see text] and [Formula: see text] be its standard adjacency matrix and the diagonal matrix of net-degrees, respectively.
M. Anđelić +3 more
doaj +1 more source
When Is a Graded Free Complex Exact?
Mathematics, 2022 Minimal free resolutions of a finitely generated module over a polynomial ring S=k[x], with variables x={x1,…,xn} and a field k have been extensively studied.
David C. Molano +2 more
doaj +1 more source
Characterization of Graphs with an Eigenvalue of Large Multiplicity
Advances in Mathematical Physics, Volume 2020, Issue 1, 2020., 2020 Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the eigenvalues of G. In this paper, we characterize all the n‐vertex graphs with some eigenvalue of multiplicity n − 2 and n − 3, respectively. Moreover, as an application of the main result, we present a family of nonregular graphs with four distinct ...
Linming Qi +4 more
wiley +1 more source
Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]
Proceedings of the Estonian Academy of SciencesGiven a finite group G, the coprime graph of G, denoted by Î(G), is defined as an undirected graph with the vertex set G, and for distinct x, y â G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y ...
Jin Chen, Shixun Lin, Xuanlong Ma
doaj +1 more source
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs.
Fernando Esteban Contreras-Mendoza +1 more
doaj +1 more source
A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs
Advances in Operations Research, Volume 2017, Issue 1, 2017., 2017 Given a graph G = (V, E), a connected sides cut (U, V\U) or δ(U) is the set of edges of E linking all vertices of U to all vertices of V\U such that the induced subgraphs G[U] and G[V\U] are connected. Given a positive weight function w defined on E, the maximum connected sides cut problem (MAX CS CUT) is to find a connected sides cut Ω such that w(Ω ...
Brahim Chaourar, Yi-Kuei Lin
wiley +1 more source
A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph
Mathematical Problems in Engineering, Volume 2016, Issue 1, 2016., 2016 In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use.
F. Liberatore +2 more
wiley +1 more source
Characterization of Protein Complexes and Subcomplexes in Protein‐Protein Interaction Databases
Biochemistry Research International, Volume 2015, Issue 1, 2015., 2015 The identification and characterization of protein complexes implicated in protein‐protein interaction data are crucial to the understanding of the molecular events under normal and abnormal physiological conditions. This paper provides a novel characterization of subcomplexes in protein interaction databases, stressing definition and representation ...
Nazar Zaki +3 more
wiley +1 more source
Some New Classes of Open Distance‐Pattern Uniform Graphs
International Journal of Combinatorics, Volume 2013, Issue 1, 2013., 2013 Given an arbitrary nonempty subset M of vertices in a graph G = (V, E), each vertex u in G is associated with the set fMo(u)={d(u,v) : v∈M, u≠v} and called its open M‐distance‐pattern. The graph G is called open distance‐pattern uniform (odpu‐) graph if there exists a subset M of V(G) such that fMo(u)=fMo(v) for all u, v ∈ V(G), and M is called an open
Bibin K. Jose, Toufik Mansour
wiley +1 more source
A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
Special MatricesIn this article, we give an O(n)O\left(n) time and space algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenvalues of Laplacian matrix related to this class of ...
Chen Guantao, Tura Fernando C.
doaj +1 more source