Group inverses of matrices with path graphs.

Catral, Minerva; Olesky, Dale D.; van den Driessche, Pauline

The search session has expired. Please query the service again.

Displaying similar documents to “Group inverses of matrices with path graphs.”

The Existence Of P≥3-Factor Covered Graphs

Sizhong Zhou, Jiancheng Wu, Tao Zhang (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.

Matrices representable by directed graphs

Zofia Majcher (1985)

Archivum Mathematicum

Similarity:

The periphery graph of a median graph

Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)

Discussiones Mathematicae Graph Theory

Similarity:

The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...

Geodetic line, middle and total graphs

Jerzy Topp (1990)

Mathematica Slovaca

Similarity:

On the Graph for which there is a Tree as the Inverse Interchange Graph of a Local Graph.

Juhani Nieminen (1972)

Manuscripta mathematica

Similarity:

Tree-Like Partial Hamming Graphs

Tanja Gologranc (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and give a new proof of that result, which holds also for a bigger class of graphs, so called tree-like...

An introduction to $F$ -graphs, a graph-theoretic representation of natural numbers.

Farrell, E.J. (1992)

International Journal of Mathematics and Mathematical Sciences

Similarity:

On the number of labeled $k$ -arch graphs.

Caminiti, Saverio, Fusco, Emanuele G. (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Graph equations, graph inequalities and a fixed point theorem.

I.B. Lackovic, D.M. Cvetkovic (1976)

Publications de l'Institut Mathématique [Elektronische Ressource]

Similarity: