Log in

Relevant bibliographies by topics / Graphs; Non-negative

Contents

Journal articles

Academic literature on the topic 'Graphs; Non-negative'

Author: Grafiati

Published: 4 June 2021

Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graphs; Non-negative.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graphs; Non-negative"

1

Teng, Wenshun, and Huijuan Wang. "Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic." Discrete Mathematics, Algorithms and Applications 12, no. 06 (2020): 2050080. http://dx.doi.org/10.1142/s1793830920500809.

Full text

Abstract:

The vertex arboricity [Formula: see text] of a graph [Formula: see text] is the minimum number of colors the vertices of the graph [Formula: see text] can be colored so that every color class induces an acyclic subgraph of [Formula: see text]. There are many results on the vertex arboricity of planar graphs. In this paper, we replace planar graphs with graphs which can be embedded in a surface [Formula: see text] of Euler characteristic [Formula: see text]. We prove that for the graph [Formula: see text] which can be embedded in a surface [Formula: see text] of Euler characteristic [Formula: see text] if no [Formula: see text]-cycle intersects a [Formula: see text]-cycle, or no [Formula: see text]-cycle intersects a [Formula: see text]-cycle, then [Formula: see text] in addition to the [Formula: see text]-regular quadrilateral mesh.

APA, Harvard, Vancouver, ISO, and other styles

2

YANHAONA, MUHAMMAD NUR, MD SHAMSUZZOHA BAYZID, and MD SAIDUR RAHMAN. "DISCOVERING PAIRWISE COMPATIBILITY GRAPHS." Discrete Mathematics, Algorithms and Applications 02, no. 04 (2010): 607–23. http://dx.doi.org/10.1142/s1793830910000917.

Full text

Abstract:

Let T be an edge weighted tree, let dT(u, v) be the sum of the weights of the edges on the path from u to v in T, and let d min and d max be two non-negative real numbers such that d min ≤ d max . Then a pairwise compatibility graph of T for d min and d max is a graph G = (V, E), where each vertex u' ∈ V corresponds to a leaf u of T and there is an edge (u', v') ∈ E if and only if d min ≤ dT(u, v) ≤ d max . A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers d min and d max such that G is a pairwise compatibility graph of T for d min and d max . Kearney et al. conjectured that every graph is a PCG [3]. In this paper, we refute the conjecture by showing that not all graphs are PCG s . Moreover, we recognize several classes of graphs as pairwise compatibility graphs. We identify two restricted classes of bipartite graphs as PCG. We also show that the well known tree power graphs and some of their extensions are PCGs.

APA, Harvard, Vancouver, ISO, and other styles

3

Jiménez González, Jesús Arturo. "Incidence graphs and non-negative integral quadratic forms." Journal of Algebra 513 (November 2018): 208–45. http://dx.doi.org/10.1016/j.jalgebra.2018.07.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Derikvand, Tajedin, and Mohammad Reza Oboudi. "Small graphs with exactly two non-negative eigenvalues." Algebraic structures and their applications 4, no. 1 (2017): 1–18. http://dx.doi.org/10.29252/asta.4.1.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Kewei. "On non-negative quasiconvex functions with unbounded zero sets." Proceedings of the Royal Society of Edinburgh: Section A Mathematics 127, no. 2 (1997): 411–22. http://dx.doi.org/10.1017/s0308210500023726.

Full text

Abstract:

We construct nontrivial, non-negative quasiconvex functions denned on M2×2 with p-th order growth such that the zero sets of the functions are Lipschitz graphs of mappings from subsets of a fixed two-dimensional subspace to its orthogonal complement. We assume that the graphs do not have rank-one connections with the Lipschitz constants sufficiently small. In particular, we are able to construct quasiconvex functions which are homogeneous of degree p (p > 1) and ‘conjugating’ invariant.

APA, Harvard, Vancouver, ISO, and other styles

6

Oboudi, Mohammad Reza. "Characterization of graphs with exactly two non-negative eigenvalues." Ars Mathematica Contemporanea 12, no. 2 (2016): 271–86. http://dx.doi.org/10.26493/1855-3974.1077.5b6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Koledin, Tamara, and Zoran Stanić. "Regular bipartite graphs with three distinct non-negative eigenvalues." Linear Algebra and its Applications 438, no. 8 (2013): 3336–49. http://dx.doi.org/10.1016/j.laa.2012.12.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chung, Fan, Yong Lin, and S. T. Yau. "Harnack inequalities for graphs with non-negative Ricci curvature." Journal of Mathematical Analysis and Applications 415, no. 1 (2014): 25–32. http://dx.doi.org/10.1016/j.jmaa.2014.01.044.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Alomari, Omar, Mohammad Abudayah, and Torsten Sander. "The non-negative spectrum of a digraph." Open Mathematics 18, no. 1 (2020): 22–35. http://dx.doi.org/10.1515/math-2020-0005.

Full text

Abstract:

Abstract Given the adjacency matrix A of a digraph, the eigenvalues of the matrix AAT constitute the so-called non-negative spectrum of this digraph. We investigate the relation between the structure of digraphs and their non-negative spectra and associated eigenvectors. In particular, it turns out that the non-negative spectrum of a digraph can be derived from the traditional (adjacency) spectrum of certain undirected bipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

10

B. Boomadevi, V. Gopal, and B. Boomadevi. "ON SIGNED (NON-NEGATIVE) MAJORITY TOTAL DOMINATION OF SOME GRAPHS." Advances in Mathematics: Scientific Journal 9, no. 4 (2020): 2039–45. http://dx.doi.org/10.37418/amsj.9.4.62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!