scholarly journals Semi-Image Neighborhood Block Graphs with Crossing Numbers

2013 ◽  
Vol 5 (2) ◽  
pp. 295-299
Author(s):  
K. M. Niranjan ◽  
P. Nagaraja ◽  
Lokesh V
Keyword(s):  
Graph Theory ◽  
Crossing Number ◽  
Sufficient Condition ◽  
Block Graph ◽  
Necessary And Sufficient Condition ◽  
Engineering Applications ◽  
Crossing Numbers ◽  
Block Graphs ◽  
Necessary And Sufficient

The advent of graph theory has played a prominent role in wide variety of engineering applications. Minimization of crossing numbers in graphs optimizes its use in many applications. In this paper, we establish the necessary and sufficient condition for Semi-Image neighborhood block graph to have crossing number 3. We also prove that the Semi-Image neighborhood block graph NBI(G) of a graph never has crossing numbers k, where    1 ? k ? 6.Keywords: Semi-Image; Neighborhood block; Crossing numbers.© 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.doi: http://dx.doi.org/10.3329/jsr.v5i2.11019        J. Sci. Res. 5 (2), 295-299 (2013)

scholarly journals Граф блоков

2019 ◽  
Author(s):  
A. Kelkar ◽  
K. Jaysurya ◽  
H.M. Nagesh
Keyword(s):  
Crossing Number ◽  
Sufficient Condition ◽  
Block Graph ◽  
Necessary And Sufficient Condition ◽  
Cut Vertex ◽  
Necessary And Sufficient

The block graph of a graph $G$, written $B(G)$, is the graph whose vertices are the blocks of $G$ and in which two vertices are adjacent whenever the corresponding blocks have a cut-vertex in common. We study the properties of $B(G)$ and present the characterization of graphs whose $B(G)$ are planar, outerplanar, maximal outerplanar, minimally non-outerplanar, Eulerian, and Hamiltonian. A necessary and sufficient condition for $B(G)$ to have crossing number one is also presented.

scholarly journals Qlick Graphs with Crossing Number One

2016 ◽  
Vol 17 ◽  
pp. 75-84
Author(s):  
Bommanahal Basavanagoud ◽  
V.R. Kulli
Keyword(s):  
Crossing Number ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Forbidden Subgraphs ◽  
Necessary And Sufficient

In this paper, we deduce a necessary and sufficient condition for graphs whose qlick graphs have crossing number one. We also obtain a necessary and sufficient condition for qlick graphs to have crossing number one in terms of forbidden subgraphs.

A Criterion for (Non-)Planarity of The Block-Transformation Graph Gαβγ when αβγ = 101

2014 ◽  
Vol 10 ◽  
pp. 38-47 ◽  
Author(s):  
B. Basavanagoud ◽  
Jaishri B. Veeragoudar
Keyword(s):  
General Concept ◽  
Crossing Number ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Vertex Set ◽  
Necessary And Sufficient

The general concept of the block-transformation graph Gαβγ was introduced in [1]. The vertices and blocks of a graph are its members. The block-transformation graph G101 of a graph G is the graph, whose vertex set is the union of vertices and blocks of G, in which two vertices are adjacent whenever the corresponding vertices of G are adjacent or the corresponding blocks of G are nonadjacent or the corresponding members of G are incident. In this paper, we present characterizations of graphs whose block-transformation graphs G101 are planar, outerplanar or minimally nonouterplanar. Further we establish a necessary and sufficient condition for the block-transformation graph G101 to have crossing number one.

scholarly journals The competition number of a generalized line graph is at most two

2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Boram Park ◽  
Yoshio Sano
Keyword(s):  
Graph Theory ◽  
Necessary Conditions ◽  
Line Graph ◽  
Sufficient Conditions ◽  
Line Graphs ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
International Audience ◽  
Necessary And Sufficient ◽  
Competition Number

Graph Theory International audience In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one. In this paper, we generalize this result to the competition numbers of generalized line graphs, that is, we show that the competition number of a generalized line graph is at most two, and give necessary conditions and sufficient conditions for the competition number of a generalized line graph being one.

Analysis on Degree of Freedom and Singularity of Mechanism Based on Topological Graph Theory

2011 ◽  
Vol 393-395 ◽  
pp. 20-23
Author(s):  
Jian Guo Luo ◽  
Mao Yan He
Keyword(s):  
Graph Theory ◽  
Degree Of Freedom ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Topological Graph ◽  
Topological Graph Theory ◽  
Hybrid Mechanism ◽  
Definition Of ◽  
Necessary And Sufficient ◽  
Case Number

Based on the analysis of current developing state of graph theory, define the description of spacial moving capability of common couples and translation base and rotation base of mechanism, based on the new description method in topological graph theory. DOF(degree of freedom) of hybrid mechanism analysised with example based on the definition of dimensionity of branch spacial moving capability and mechanism spacial moving capability, necessary and sufficient condition of nonsingularity of mechanism presented, as well as the necessary and sufficient condition of singularity of mechanism deduced , in-phase and assimilation condition and in-phase and dissimilarity condition and asynchronism condition of limitation of input base of branch adopted, case number of position singularity and pose singularity and position and pose singularity obtained then, still the way of founding the combination and case number of common serial mechanism and parallel mechanism and hybrid mechanism mentioned.

Analysis on Degree of Freedom and Singularity of Mechanism Based on Topological Graph Theory

2012 ◽  
Vol 430-432 ◽  
pp. 1943-1946
Author(s):  
Jian Guo Luo ◽  
Mao Yan He
Keyword(s):  
Graph Theory ◽  
Degree Of Freedom ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Topological Graph ◽  
Topological Graph Theory ◽  
Hybrid Mechanism ◽  
Definition Of ◽  
Necessary And Sufficient ◽  
Case Number

Based on the analysis of current developing state of graph theory, define the description of spacial moving capability of common couples and translation base and rotation base of mechanism, based on the new description method in topological graph theory. DOF(degree of freedom) of hybrid mechanism analysised with example based on the definition of dimensionity of branch spacial moving capability and mechanism spacial moving capability, necessary and sufficient condition of nonsingularity of mechanism presented, as well as the necessary and sufficient condition of singularity of mechanism deduced , in-phase and assimilation condition and in-phase and dissimilarity condition and asynchronism condition of limitation of input base of branch adopted, case number of position singularity and pose singularity and position and pose singularity obtained then, still the way of founding the combination and case number of common serial mechanism and parallel mechanism and hybrid mechanism mentioned.

A Proposed Framework Emphasizing Auditor Reliability over Auditor Independence

2003 ◽  
Vol 17 (3) ◽  
pp. 257-266 ◽  
Author(s):  
Mark H. Taylor ◽  
F. Todd DeZoort ◽  
Edward Munn ◽  
Martha Wetterhall Thomas
Keyword(s):  
Public Interest ◽  
Auditor Independence ◽  
Public Confidence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Accounting Profession ◽  
The Public ◽  
Necessary And Sufficient

This paper introduces an auditor reliability framework that repositions the role of auditor independence in the accounting profession. The framework is motivated in part by widespread confusion about independence and the auditing profession's continuing problems with managing independence and inspiring public confidence. We use philosophical, theoretical, and professional arguments to argue that the public interest will be best served by reprioritizing professional and ethical objectives to establish reliability in fact and appearance as the cornerstone of the profession, rather than relationship-based independence in fact and appearance. This revised framework requires three foundation elements to control subjectivity in auditors' judgments and decisions: independence, integrity, and expertise. Each element is a necessary but not sufficient condition for maximizing objectivity. Objectivity, in turn, is a necessary and sufficient condition for achieving and maintaining reliability in fact and appearance.

Sign in / Sign up

Export Citation Format

Share Document